The smallest triangle-free 4-chromatic 4-regular graph
From MaRDI portal
Publication:5589117
DOI10.1016/S0021-9800(70)80057-6zbMath0193.53101WikidataQ29541010 ScholiaQ29541010MaRDI QIDQ5589117
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, The smallest 5-chromatic tournament, A note on Reed's conjecture for triangle-free graphs, New potential functions for greedy independence and coloring, Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs, On an upper bound of the graph's chromatic number, depending on the graph's degree and density, Algorithmic bounds for the chromatic number†, On off-diagonal ordered Ramsey numbers of nested matchings, Computers and discovery in algebraic graph theory
