On clique immersions in line graphs
From MaRDI portal
Publication:2005686
DOI10.1016/j.disc.2020.112095zbMath1448.05169arXiv1909.07964OpenAlexW3081920013MaRDI QIDQ2005686
Jessica McDonald, Michael Guyer
Publication date: 8 October 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.07964
Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Clique immersion in graph products ⋮ Totally odd immersions in line graphs ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Hajós' conjecture for line graphs
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Hadwiger's conjecture for line graphs
- Graphe représentatif des aretes d'un multigraphe
- A Structure Theorem for Strong Immersions
- Graph Coloring and the Immersion Order
- Immersing small complete graphs
- Characterizations of derived graphs
- Forcing clique immersions through chromatic number
This page was built for publication: On clique immersions in line graphs