Subdivisions in dicritical digraphs with large order or digirth

DOI10.1016/J.EJC.2024.104022zbMATH Open1548.05149MaRDI QIDQ6612301

Clément Rambaud, L. Picasarri-Arrieta

Publication date: 30 September 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

dichromatic number of a digraph

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two results on the digraph chromatic number
• Immersing complete digraphs
• Color-critical graphs have logarithmic circumference
• Degree and local connectivity in digraphs
• Disjoint directed cycles
• Longest paths in digraphs
• Chromatic number, girth and maximal degree
• Topological subgraphs in graphs of large girth
• Topological minors in graphs of large girth
• Immersion of transitive tournaments in digraphs with large minimum outdegree
• Dichromatic number and forced subdivisions
• Subdivisions in digraphs of large out-degree or large dichromatic number
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Highly linked graphs
• The probabilistic method
• Graph decomposition with applications to subdivisions and path systems modulo k
• Diconnected Orientations and a Conjecture of Las Vergnas
• The circular chromatic number of a digraph
• Long cycles in critical graphs
• Cycles with two blocks in k‐chromatic digraphs
• Subdivisions of oriented cycles in digraphs with large chromatic number
• Digraphs
• Paths and Circuits in Critical Graphs
• Subdivisions with congruence constraints in digraphs of large chromatic number

This page was built for publication: Subdivisions in dicritical digraphs with large order or digirth

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