Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number

DOI10.1016/j.disc.2022.113209zbMath1502.05119OpenAlexW4300971970MaRDI QIDQ2092433

Mouhamad El Joubbeh

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113209

zbMATH Keywords

chromatic numbersubdivisionsHamiltonian digraphsoriented cycles\(k\)-secant edges

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paths with two blocks in \(n\)-chromatic digraphs
• On three blocks paths \(P (k, l, r)\)
• Graph Theory and Probability
• Diconnected Orientations and a Conjecture of Las Vergnas
• Cycles with two blocks in k‐chromatic digraphs
• Subdivisions of oriented cycles in digraphs with large chromatic number
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I

This page was built for publication: Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number