Subdivisions with congruence constraints in digraphs of large chromatic number
From MaRDI portal
Publication:6183432
DOI10.1002/jgt.23020zbMath1529.05074arXiv2208.06358OpenAlexW4385636833MaRDI QIDQ6183432
No author found.
Publication date: 4 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.06358
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Coloring digraphs with forbidden cycles
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- On the conjecture of Hajos
- The dichromatic number of a digraph
- Dichromatic number and forced subdivisions
- Subdivisions of digraphs in tournaments
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Graph decomposition with applications to subdivisions and path systems modulo k
- Cycles Modulo k
- Topological cliques in graphs II
- Totally odd subdivisions and parity subdivisions: Structures and Coloring
- Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
- Divisible subdivisions
This page was built for publication: Subdivisions with congruence constraints in digraphs of large chromatic number
