On bispindles \(B(k_1,k_2;1)\) in strongly connected digraphs with large chromatic number

MaRDI QIDQ6644891

Darine Al-Mniny

Publication date: 28 November 2024

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

graph theorychromatic numberstrongly connected digraphsHamiltonian digraphsdirected cyclesspindles(2+1)-bispindlebispindles

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Paths with two blocks in \(n\)-chromatic digraphs
• Oriented trees in digraphs
• Subdivisions of four blocks cycles in digraphs with large chromatic number
• Bispindle in strongly connected digraphs with large chromatic number
• 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

Related Items (1)

Secant edges: a tool for Cohen et al.'s conjectures about subdivisions of oriented cycles and bispindles in Hamiltonian digraphs with large chromatic number

This page was built for publication: On bispindles \(B(k_1,k_2;1)\) in strongly connected digraphs with large chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644891)