A Generalization of \chi -Binding Functions

DOI10.1007/978-981-19-7014-6_11MaRDI QIDQ6193839zbMATH OpenOpenAlexFDO

Authors M. A. Shalu, T. P. Sandhya

Publication date 13 February 2024

Published in Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-19-7014-6_11

zbMATH Keywords

chromatic numberclique numberindependence number

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatic bounds for some classes of 2 K₂-free graphs
• Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Linear χ -binding functions for some classes of ( P ₃ ∪ P ₂ )-free graphs

Cites work

• A bound on the chromatic number of graphs without certain induced subgraphs
• Graph Theory and Probability
• scientific article; zbMATH DE number 1002021 (Why is no real title available?)
• scientific article; zbMATH DE number 3480625 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• On diameters and radii of bridged graphs
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• Radius two trees specify χ‐bounded classes

Cited in

(1)

• \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs

This page was built for publication: A Generalization of $$\chi $$-Binding Functions

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