Hajos' graph-coloring conjecture: Variations and counterexamples
From MaRDI portal
Publication:1249185
DOI10.1016/0095-8956(79)90062-5zbMath0385.05033OpenAlexW2034842587MaRDI QIDQ1249185
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90062-5
Related Items (61)
Improved bound for improper colourings of graphs with no odd clique minor ⋮ The Crossing Number of the Cone of a Graph ⋮ Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant ⋮ Minimal orientations of colour critical graphs ⋮ On complete subgraphs of color-critical graphs ⋮ Note on a conjecture of Toft ⋮ A Relative of Hadwiger's Conjecture ⋮ On the optimal transversals of the odd cycles ⋮ Graph homomorphisms into the five-cycle ⋮ Brooks' Theorem and Beyond ⋮ Hajós' conjecture for line graphs ⋮ Fractional and integral colourings ⋮ $K_5^-$-Subdivision in 4-Connected Graphs ⋮ A Note on Hitting Maximum and Maximal Cliques With a Stable Set ⋮ Topological cliques of random graphs ⋮ Independent paths and \(K_{5}\)-subdivisions ⋮ Clustered variants of Hajós' conjecture ⋮ Linking four vertices in graphs of large connectivity ⋮ Special subdivisions of \(K_4\) and 4-chromatic graphs ⋮ Clique immersion in graph products ⋮ 4‐Separations in Hajós graphs ⋮ Remarks on a conjecture of Barát and Tóth ⋮ Totally odd immersions in line graphs ⋮ Hadwiger's Conjecture for the Complements of Kneser Graphs ⋮ Topological minors in graphs of large girth ⋮ Some mader-perfect graph classes ⋮ The Crossing Number of the Cone of a Graph ⋮ Subdivisions with congruence constraints in digraphs of large chromatic number ⋮ Hadwiger's conjecture is true for almost every graph ⋮ On Tutte's extension of the four-colour problem ⋮ Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz ⋮ Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker ⋮ Homomorphisms of signed graphs: an update ⋮ Chromatic number and complete graph substructures for degree sequences ⋮ Hadwiger's conjecture for inflations of 3-chromatic graphs ⋮ Complete graph immersions in dense graphs ⋮ Gallai's problem on Dirac's construction ⋮ Hadwiger's conjecture and inflations of the Petersen graph ⋮ Hajós' conjecture and cycle power graphs ⋮ Some remarks on Hajós' conjecture ⋮ The thickness and chromatic number of \(r\)-inflated graphs ⋮ On topological relaxations of chromatic conjectures ⋮ Reducing Hajós' 4-coloring conjecture to 4-connected graphs ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4256105 Haj�s constructions of critical graphs] ⋮ Circular chromatic number of signed graphs ⋮ On a coloring conjecture of Hajós ⋮ Triangulations and the Hajós conjecture ⋮ Graphs Containing TopologicalH ⋮ Improper colouring of graphs with no odd clique minor ⋮ Hadwiger's conjecture for proper circular arc graphs ⋮ Hadwiger’s Conjecture ⋮ Dichromatic number and forced subdivisions ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Edge-disjoint odd cycles in graphs with small chromatic numbers ⋮ Coloring graphs with no \(\text{odd-}K_4\) ⋮ A note on coloring vertex-transitive graphs ⋮ Rooted topological minors on four vertices ⋮ Immersion and clustered coloring ⋮ Independence, clique size and maximum degree ⋮ Homomorphisms of Signed Graphs
Cites Work
This page was built for publication: Hajos' graph-coloring conjecture: Variations and counterexamples
