Odd clique minors and chromatic bounds of {3K₁, paraglider}-free graphs

DOI10.1016/J.DISC.2026.115266MaRDI QIDQ7314013zbMATH OpenFDO

Authors Yuqing Ji, Yujun Yang, Xia Zhang

Publication date 13 August 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115266

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cites work

• A bound on the chromatic number of a graph
• A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A survey of -boundedness
• Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
• Claw-free graphs. VI: Colouring
• Coloring quasi-line graphs
• Hadwiger's conjecture
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Hadwiger's conjecture for graphs with forbidden holes
• scientific article; zbMATH DE number 2186978 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• Independent sets and matchings in subcubic graphs
• Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
• Normal hypergraphs and the perfect graph conjecture
• Odd Hadwiger for line-graphs
• On a special case of Hadwiger's conjecture
• On Hadwiger's Number and the Stability Number
• On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
• On the chromatic index of multigraphs without large triangles
• On the chromatic number of \(2 K_2\)-free graphs
• On the chromatic number of a graph with two forbidden subgraphs
• On the divisibility of graphs
• Recent progress towards Hadwiger's conjecture
• Some remarks on the odd Hadwiger's conjecture
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The strong perfect graph theorem
• Über eine Eigenschaft der ebenen Komplexe

This page was built for publication: Odd clique minors and chromatic bounds of {\(3K_1\), paraglider}-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314013)