-binding function for (C₄, t-broom^+)-free graphs

DOI10.1016/J.DISC.2024.114124zbMATH Open1543.05133MaRDI QIDQ6570047FDOQ6570047

Authors: Chiyu Zhou, Jialei Song, Di Wu 

Publication date: 10 July 2024

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

Recommendations

• Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
• Chromatic number of triangle-free graphs with some forbidden subgraphs
• Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
• A Generalization of $$\chi $$-Binding Functions
• The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices

zbMATH Keywords

chromatic numberclique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10)

Cites Work

• Graph Theory and Probability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph theory with applications
• The strong perfect graph theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ramsey-type theorems
• Coloring the hypergraph of maximal cliques of a graph with no long path
• Graph classes with linear Ramsey numbers
• Title not available (Why is that?)
• Square-free graphs with no induced fork
• Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
• Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
• Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
• Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path

This page was built for publication: \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs

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