Clique immersions and independence number
From MaRDI portal
Publication:2674557
DOI10.1016/j.ejc.2022.103550zbMath1497.05199arXiv1907.01720OpenAlexW4288288910MaRDI QIDQ2674557
José Zamora, Daniel A. Quiroz, Maya Jakobine Stein, Sebastián Bustamante
Publication date: 14 September 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01720
Relations of low-dimensional topology with graph theory (57M15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimum degree condition forcing complete graph immersion
- Complete graph immersions in dense graphs
- Large minors in graphs with given independence number
- Graph minors. XX: Wagner's conjecture
- Lower bound of the Hadwiger number of graphs by their average degree
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Clique immersions in graphs of independence number two with certain forbidden subgraphs
- Large immersions in graphs with independence number 3 and 4
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
- Complete minors, independent sets, and chordal graphs
- Complete Minors and Independence Number
- Graph Coloring and the Immersion Order
- Immersing small complete graphs
- An extremal function for contractions of graphs
- On Hadwiger's Number and the Stability Number
- Complete graph immersions and minimum degree
- Independence number and clique minors
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Forcing clique immersions through chromatic number
This page was built for publication: Clique immersions and independence number
