Immersing complete digraphs

DOI10.1016/j.ejc.2012.02.002zbMath1243.05092arXiv1109.3741OpenAlexW1995632009MaRDI QIDQ427820

Diego Scheide, Bojan Mohar, Jessica McDonald, Matt DeVos

Publication date: 18 June 2012

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

Full work available at URL: https://arxiv.org/abs/1109.3741

zbMATH Keywords

Eulerian digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Immersion of transitive tournaments in digraphs with large minimum outdegree ⋮ Constructing Graphs with No Immersion of Large Complete Graphs ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree and local connectivity in digraphs
• Even cycles in directed graphs
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
• Immersing small complete graphs
• A note on complete subdivisions in digraphs of large outdegree
• On topological tournaments of order 4 in digraphs of outdegree 3

This page was built for publication: Immersing complete digraphs