Zobrazeno 1 - 10
of 198
pro vyhledávání: '"edge-chromatic critical graphs"'
In this paper, by developing several new adjacency lemmas about a path on $4$ or $5$ vertices, we show that the average degree of 7-critical graphs is at least 6. It implies Vizing's planar graph conjecture for planar graphs with maximum degree $7$ a
Externí odkaz:
http://arxiv.org/abs/2301.02140
Autor:
Steffen, Eckhard, Wolf, Isaak H.
Publikováno v:
Graphs and Combinatorics 38, 104 (2022)
A finite simple connected graph $G$ with maximum degree $k$ is $k$-critical if it has chromatic index $\chi'(G)=k+1$ and $\chi'(G-e)=k$ for every edge $e\in E(G)$. Bej and the first author raised the question whether every $k$-critical graph has an e
Externí odkaz:
http://arxiv.org/abs/2109.11447
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Klopp, Antje, Steffen, Eckhard
Publikováno v:
Graphs and Combinatorics (2021)
The first part of the paper studies star-cycle factors of graphs. It characterizes star-cycle factors of a graph $G$ and proves upper bounds for the minimum number of $K_{1,2}$-components in a $\{K_{1,1}, K_{1,2}, C_n\colon n\ge 3\}$-factor of a grap
Externí odkaz:
http://arxiv.org/abs/1903.12385
Autor:
Cao, Yan, Chen, Guantao
Publikováno v:
In Journal of Combinatorial Theory, Series B March 2021 147:299-338
Autor:
Cao, Yan1 (AUTHOR), Chen, Guantao2 (AUTHOR), Jing, Guangming1 (AUTHOR), Shan, Songling3 (AUTHOR) sshan12@ilstu.edu
Publikováno v:
Journal of Graph Theory. Oct2022, Vol. 101 Issue 2, p288-310. 23p.
Autor:
Cao, Yan, Chen, Guantao
Publikováno v:
In Journal of Combinatorial Theory, Series B November 2020 145:470-486
Let $G$ be a simple graph with maximum degree $\Delta(G)$ and chromatic index $\chi'(G)$. A classic result of Vizing indicates that either $\chi'(G )=\Delta(G)$ or $\chi'(G )=\Delta(G)+1$. The graph $G$ is called $\Delta$-critical if $G$ is connected
Externí odkaz:
http://arxiv.org/abs/1805.05996
Autor:
Klopp, Antje1 (AUTHOR), Steffen, Eckhard2 (AUTHOR) es@upb.de
Publikováno v:
Graphs & Combinatorics. Mar2021, Vol. 37 Issue 2, p559-580. 22p.
Autor:
Steffen, Eckhard1 (AUTHOR) es@upb.de, Wolf, Isaak H.1 (AUTHOR)
Publikováno v:
Graphs & Combinatorics. Jun2022, Vol. 38 Issue 3, p1-11. 11p.