Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Jing Guangming"'
Autor:
Jing, Guangming
Let $\Delta(G)$ and $\chi'(G)$ be the maximum degree and chromatic index of a graph $G$, respectively. Appearing in different format, Gupta\,(1967), Goldberg\,(1973), Andersen\,(1977), and Seymour\,(1979) made the following conjecture: Every multigra
Externí odkaz:
http://arxiv.org/abs/2308.15588
Autor:
Chen Xiaofeng, Fang Wei, Gao Wei, Gao Yubin, Jing Guangming, Li Zhongshan, Shao Yanling, Zhang Lihua
Publikováno v:
Special Matrices, Vol 4, Iss 1 (2016)
A sign pattern (matrix) is a matrix whose entries are from the set {+, −, 0} and a sign vector is a vector whose entries are from the set {+, −, 0}. A sign pattern or sign vector is full if it does not contain any zero entries. The minimum rank o
Externí odkaz:
https://doaj.org/article/1cece89564a7494389759f66989e9af2
Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum $\Delta$-edge-colorable subgraph and a matching. They further conjectured that every graph $G$ with chromatic ind
Externí odkaz:
http://arxiv.org/abs/2211.05930
Let $G$ be a simple graph. Denote by $n$, $\Delta(G)$ and $\chi' (G)$ be the order, the maximum degree and the chromatic index of $G$, respectively. We call $G$ \emph{overfull} if $|E(G)|/\lfloor n/2\rfloor > \Delta(G)$, and {\it critical} if $\chi'(
Externí odkaz:
http://arxiv.org/abs/2208.04179
Let $G$ be a graph with maximum degree $\Delta(G)$ and maximum multiplicity $\mu(G)$. Vizing and Gupta, independently, proved in the 1960s that the chromatic index of $G$ is at most $\Delta(G)+\mu(G)$. The distance between two edges $e$ and $f$ in $G
Externí odkaz:
http://arxiv.org/abs/2204.01074
Publikováno v:
In European Journal of Combinatorics December 2024 122
Let $G=(V(G), E(G))$ be a multigraph with maximum degree $\Delta(G)$, chromatic index $\chi'(G)$ and total chromatic number $\chi''(G)$. The Total Coloring conjecture proposed by Behzad and Vizing, independently, states that $\chi''(G)\leq \Delta(G)+
Externí odkaz:
http://arxiv.org/abs/2109.07610
A simple graph $G$ with maximum degree $\Delta$ is overfull if $|E(G)|>\Delta \lfloor |V(G)|/2\rfloor$. The core of $G$, denoted $G_{\Delta}$, is the subgraph of $G$ induced by its vertices of degree $\Delta$. Clearly, the chromatic index of $G$ equa
Externí odkaz:
http://arxiv.org/abs/2108.04399
A simple graph $G$ with maximum degree $\Delta$ is \emph{overfull} if $|E(G)|>\Delta \lfloor |V(G)|/2\rfloor$. The \emph{core} of $G$, denoted $G_{\Delta}$, is the subgraph of $G$ induced by its vertices of degree $\Delta$. Clearly, the chromatic ind
Externí odkaz:
http://arxiv.org/abs/2108.03549
Publikováno v:
In Journal of Combinatorial Theory, Series B May 2024 166:154-182