Large immersions in graphs with independence number 3 and 4

DOI10.1016/j.entcs.2019.08.020OpenAlexW2977481386WikidataQ113317412 ScholiaQ113317412MaRDI QIDQ2132349

José Zamora, Daniel A. Quiroz, Sebastián Bustamante, Maya Jakobine Stein

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.020

zbMATH Keywords

independence numberchromatic numberHadwiger's conjecturegraph immersion

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items

Clique immersions and independence number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar graphs have independence ratio at least 3/13
• 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
• 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