On the conjecture of Hajos
From MaRDI portal
Publication:1835686
Recommendations
Cites work
- scientific article; zbMATH DE number 3675940 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Colouring problems
- Some remarks on the theory of graphs
- The existence of unavoidable sets of geographically good configurations
Cited in
(34)- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
- Remarks on a conjecture of Barát and Tóth
- Hajós' conjecture for line graphs
- Clustered variants of Hajós' conjecture
- Triangulations and the Hajós conjecture
- Subdivisions with congruence constraints in digraphs of large chromatic number
- Topological minors in graphs of large girth
- On a conjecture raised by Yuzo Hosono
- The Kelmans-Seymour conjecture. IV: A proof
- Topological Cliques in Graphs
- Some remarks on Hajós' conjecture
- scientific article; zbMATH DE number 653253 (Why is no real title available?)
- List-coloring graphs without subdivisions and without immersions
- Graphs containing topological \(H\)
- On a coloring conjecture of Hajós
- Reflections on graph theory
- scientific article; zbMATH DE number 5299731 (Why is no real title available?)
- Dichromatic number and forced subdivisions
- Study on the vertex chromatic conjecture of the graph
- scientific article; zbMATH DE number 3882454 (Why is no real title available?)
- Topological cliques of random graphs
- Hunt's hypothesis (H) and Getoor's conjecture
- Coloring immersion-free graphs
- Independence, clique size and maximum degree
- Immersion and clustered coloring
- Rooted topological minors on four vertices
- Hadwiger's conjecture
- Topological cliques in graphs II
- Packing topological minors half‐integrally
- Hadwiger's conjecture is true for almost every graph
- Hajós' conjecture and cycle power graphs
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs
- 4‐Separations in Hajós graphs
This page was built for publication: On the conjecture of Hajos
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835686)