Hadwiger number and the Cartesian product of graphs
From MaRDI portal
Publication:1014821
DOI10.1007/s00373-008-0795-7zbMath1215.05169arXivmath/0505455OpenAlexW2019462472MaRDI QIDQ1014821
J. Krishnam Raju, L. Sunil Chandran, Alexandr V. Kostochka
Publication date: 29 April 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0505455
Related Items (3)
Hadwiger's conjecture for squares of 2-trees ⋮ A note on graph minors and strong products ⋮ Hadwiger’s Conjecture and Squares of Chordal Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dense minors in graphs of large girth
- On the Hadwiger's conjecture for graph products
- Cartesian graph factorization at logarithmic cost per edge
- Contractions of graphs: A theorem of Ore and an extremal problem
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Homomorphiesätze für Graphen
- Beweis einer Abschwächung der Hadwiger-Vermutung
- Graphs with Given Group and Given Graph-Theoretical Properties
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- An extremal function for contractions of graphs
- Minors in graphs of large girth
- Primes in short intervals
- Minors and strong products
This page was built for publication: Hadwiger number and the Cartesian product of graphs
