Clique immersions in graphs of independence number two with certain forbidden subgraphs

DOI10.1016/j.disc.2021.112365zbMath1462.05285arXiv2004.05433OpenAlexW3138725079MaRDI QIDQ2022152

Daniel A. Quiroz

Publication date: 28 April 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.05433

zbMATH Keywords

independence numberchromatic numbercliqueforbidden subgraphsHadwiger's conjecturegraph immersion

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Clique immersions and independence number

Cites Work

• Unnamed Item
• Unnamed Item
• Complete graph immersions in dense graphs
• On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Hajos' graph-coloring conjecture: Variations and counterexamples
• Hadwiger's conjecture for line graphs
• On clique immersions in line graphs
• A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
• A special case of Hadwiger's conjecture
• Packing seagulls
• Hadwiger’s Conjecture
• Complete Minors and Independence Number
• Graph Coloring and the Immersion Order
• Immersing small complete graphs
• Hadwiger's conjecture for quasi-line graphs
• On Hadwiger's Number and the Stability Number
• Connected matchings and Hadwiger's conjecture
• On a special case of Hadwiger's conjecture
• Hadwiger's Conjecture for Graphs with Forbidden Holes
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Combinatorial Relations and Chromatic Graphs
• Forcing clique immersions through chromatic number

This page was built for publication: Clique immersions in graphs of independence number two with certain forbidden subgraphs