Fall coloring of graphs. I

DOI10.7151/DMGT.1501zbMATH Open1217.05086OpenAlexW2024698458MaRDI QIDQ2997599FDOQ2997599

Authors: R. Balakrishnan, T. Kavaskar 

Publication date: 9 May 2011

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/21aeea8ba1cac640f0e6094d57c0c171942180bc

Recommendations

• scientific article; zbMATH DE number 1506511
• Color chain of a graph
• Fall coloring of graphs. II
• On graph fall-coloring: existence and constructions
• On fall colorings of graphs.

zbMATH Keywords

color dominating vertexfall coloring of graphsnon-fall colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (11)

• On graph fall-coloring -- operators and heredity
• Independent domatic partitioning or fall coloring of strongly chordal graphs
• On fall colorings of graphs.
• Fall colorings on Cartesian products and regular graphs
• On graph fall-coloring: existence and constructions
• Title not available (Why is that?)
• A note on fall colorings of Kneser graphs
• Color chain of a graph
• Fall coloring of graphs. II
• Fall coloring on product of cycles and powers
• Graphs with small fall-spectrum

This page was built for publication: Fall coloring of graphs. I

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