A note on clique immersion of strong product graphs
From MaRDI portal
Publication:6635105
DOI10.1016/J.DISC.2024.114237MaRDI QIDQ6635105
Publication date: 9 November 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A minimum degree condition forcing complete graph immersion
- The structure of graphs not admitting a fixed immersion
- Hajós' conjecture for line graphs
- Immersion in four-edge-connected graphs
- 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
- Immersion and clustered coloring
- 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
- Clique immersion in graph products
- Totally odd immersions in line graphs
- The immersion-minimal infinitely edge-connected graph
This page was built for publication: A note on clique immersion of strong product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635105)
