Complete graph immersions in dense graphs
From MaRDI portal
Publication:512586
DOI10.1016/j.disc.2017.01.001zbMath1357.05072arXiv1502.01786OpenAlexW1692994421MaRDI QIDQ512586
Publication date: 27 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.01786
Related Items (5)
Weight distributions for projective binary linear codes from Weil sums ⋮ Large immersions in graphs with independence number 3 and 4 ⋮ Clique immersions and independence number ⋮ Forcing clique immersions through chromatic number ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- On search, decision, and the efficiency of polynomial-time algorithms
- On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory
- Critical graphs with connected complements
- A special case of Hadwiger's conjecture
- Packing seagulls
- Beweis einer Abschwächung der Hadwiger-Vermutung
- Constructing Graphs with No Immersion of Large Complete Graphs
- Forbidding Kuratowski Graphs as Immersions
- Graph Coloring and the Immersion Order
- Immersing small complete graphs
- Nonconstructive tools for proving polynomial-time decidability
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- Fast Algorithms forK4Immersion Testing
- On a special case of Hadwiger's conjecture
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Some Theorems on Abstract Graphs
This page was built for publication: Complete graph immersions in dense graphs
