Note on Choudum's “chromatic bounds for a class of graphs”

DOI10.1002/JGT.3190040303MaRDI QIDQ3880862zbMATHOpenAlexFDO

Authors Medha Javdekar

Publication date 1980

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190040303

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(8)

• Graph theory (algorithmic, algebraic, and metric problems)
• Claw-free graphs---a survey
• Some applications of Vizing's theorem to vertex colorings of graphs
• On the chromatic index of multigraphs without large triangles
• Applications of edge coloring of multigraphs to vertex coloring of graphs
• On the chromatic number of a graph with two forbidden subgraphs
• Improvement on Brooks' chromatic bound for a class of graphs
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey

This page was built for publication: Note on Choudum's “chromatic bounds for a class of graphs”

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