Chromatically fixed, free and totally free points in a graph

MaRDI QIDQ3113183zbMATH OpenFDO

Authors E. Sampathkumar

Publication date 8 February 2012

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Unique list-colourability and the fixing chromatic number of graphs
• Independent sets in k-chromatic graphs
• On circuits and subgraphs of chromatic graphs
• Absolutely 3-chromatic graphs
• Generalizations of independence and chromatic numbers of a graph

This page was built for publication: Chromatically fixed, free and totally free points in a graph

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