Subdivisions of four blocks cycles in digraphs with large chromatic number
From MaRDI portal
Publication:2235256
Recommendations
- Subdivisions of oriented cycles in digraphs with large chromatic number
- Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number
- Cycles with two blocks in \(k\)-chromatic digraphs
- Dichromatic number and forced subdivisions
- Bispindles in strongly connected digraphs with large chromatic number
Cites work
- scientific article; zbMATH DE number 3708430 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- Cycle length parities and the chromatic number
- Cycle lengths and chromatic number of graphs
- Diconnected Orientations and a Conjecture of Las Vergnas
- Graph Theory and Probability
- Graphs with \(k\) odd cycle lengths
- Graphs with odd cycle lengths 5 and 7 are 3-colorable
- Nombre chromatique et plus longs chemins d'un graphe
- On chromatic number of graphs and set-systems
- Oriented trees in digraphs
- Paths with two blocks in \(n\)-chromatic digraphs
- Structure and Coloring of Graphs with Only Small Odd Cycles
- Subdivisions of oriented cycles in digraphs with large chromatic number
Cited in
(8)- Partitionable sets and cyclic BSECs with block size four
- Subdivisions of oriented cycles in digraphs with large chromatic number
- Bispindles in strongly connected digraphs with large chromatic number
- Cycles with two blocks in \(k\)-chromatic digraphs
- Subdivisions with congruence constraints in digraphs of large chromatic number
- On bispindles \(B(k_1,k_2;1)\) in strongly connected digraphs with large chromatic number
- Bispindle in strongly connected digraphs with large chromatic number
- Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number
This page was built for publication: Subdivisions of four blocks cycles in digraphs with large chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235256)