Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Hoang, Chinh T."'
Autor:
Cameron, Ben, Hoàng, Chính T.
A graph is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)
Externí odkaz:
http://arxiv.org/abs/2306.03376
Autor:
Hoang, Chinh T., Robin, Cleophee
The closure of a graph $G$ is the graph $G^*$ obtained from $G$ by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least $n$, where $n$ is the number of vertices of $G$. The well-known Closure Lemma proved by Bon
Externí odkaz:
http://arxiv.org/abs/2303.03479
Autor:
Cameron, Ben, Hoàng, Chính T.
We give a new, stronger proof that there are only finitely many $k$-vertex-critical ($P_5$,~gem)-free graphs for all $k$. Our proof further refines the structure of these graphs and allows for the implementation of a simple exhaustive computer search
Externí odkaz:
http://arxiv.org/abs/2212.04659
A graph $G$ is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)
Externí odkaz:
http://arxiv.org/abs/2206.03422
Publikováno v:
In Discrete Applied Mathematics 31 December 2024 359:419-424
Publikováno v:
In Discrete Applied Mathematics 15 February 2024 344:179-187
Autor:
Hoàng, Chính T., Trotignon, Nicolas
Publikováno v:
In Discrete Mathematics January 2024 347(1)
For $k \geq 3$, we prove (i) there is a finite number of $k$-vertex-critical $(P_2+\ell P_1)$-free graphs and (ii) $k$-vertex-critical $(P_3+P_1)$-free graphs have at most $2k-1$ vertices. Together with previous research, these results imply the foll
Externí odkaz:
http://arxiv.org/abs/2007.00057
A hole is an induced cycle with at least four vertices. A hole is even if its number of vertices is even. Given a set L of graphs, a graph G is L-free if G does not contain any graph in L as an induced subgraph. Currently, the following two problems
Externí odkaz:
http://arxiv.org/abs/1904.08180