Clique immersion in graph products
From MaRDI portal
Publication:6041549
DOI10.1016/j.disc.2023.113421zbMath1515.05128arXiv1908.10457OpenAlexW2971290226MaRDI QIDQ6041549
Megan E. Heenehan, Karen L. Collins, Jessica McDonald
Publication date: 31 May 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.10457
Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimum degree condition forcing complete graph immersion
- On the Hadwiger's conjecture for graph products
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Hajos' graph-coloring conjecture: Variations and counterexamples
- A note on immersion minors and planarity
- On clique immersions in line graphs
- Constructing Graphs with No Immersion of Large Complete Graphs
- Graph Coloring and the Immersion Order
- Complete graph immersions and minimum degree
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
- Forcing clique immersions through chromatic number
- Minors and strong products
This page was built for publication: Clique immersion in graph products