Extremal problems for chromatic neighborhood sets

DOI10.1002/JGT.10036MaRDI QIDQ4537556zbMATH OpenOpenAlexFDO

Authors

Publication date 1 July 2002

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

Full work available at URL http://hdl.handle.net/1807/9522

zbMATH Keywords

chromatic numberneighborhooddegree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatic neighborhood sets
• Publication:3027033
• Extremal values of the chromatic number for a given degree sequence
• scientific article; zbMATH DE number 2201825
• A neighborhood condition which implies the existence of a class of d‐chromatic subgraphs

Cites work

• A remark on the existence of finite graphs
• Chromatic neighborhood sets
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On some conjectures of Graffiti

Cited in

(4)

• A neighborhood condition which implies the existence of a class of d‐chromatic subgraphs
• scientific article; zbMATH DE number 2201825 (Why is no real title available?)
• Extremal problems involving neighborhood unions
• Extremal values of the chromatic number for a given degree sequence

This page was built for publication: Extremal problems for chromatic neighborhood sets

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