On graph fall-coloring: existence and constructions

DOI10.1007/s00373-019-02082-7zbMath1431.05122OpenAlexW2971683928WikidataQ127307417 ScholiaQ127307417MaRDI QIDQ2287754

Hemanshu Kaul, Christodoulos Mitillos

Publication date: 21 January 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02082-7

zbMATH Keywords

chromatic numbergraph productsidomatic partitionfall-coloringindependent domatic partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Complexity of fall coloring for restricted graph classes

Cites Work

• On idomatic partitions of direct products of complete graphs
• On domination and independent domination numbers of a graph
• Idomatic partitions of direct products of complete graphs
• Fall colouring of bipartite graphs and Cartesian products of graphs
• Remarks about disjoint dominating sets
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• Disjoint independent dominating sets in graphs
• Independent domination in graphs: A survey and recent results
• Applications of product colouring
• Properties of Hereditary Hypergraphs and Middle Graphs
• Independent dominating sets in graphs of girth five
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On graph fall-coloring: existence and constructions