On graph fall-coloring: existence and constructions
From MaRDI portal
Publication:2287754
DOI10.1007/S00373-019-02082-7zbMATH Open1431.05122OpenAlexW2971683928WikidataQ127307417 ScholiaQ127307417MaRDI QIDQ2287754FDOQ2287754
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
Recommendations
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications of product colouring
- Independent domination in graphs: A survey and recent results
- Title not available (Why is that?)
- On domination and independent domination numbers of a graph
- Properties of Hereditary Hypergraphs and Middle Graphs
- Remarks about disjoint dominating sets
- Disjoint cliques and disjoint maximal independent sets of vertices in graphs
- Disjoint independent dominating sets in graphs
- Fall colouring of bipartite graphs and Cartesian products of graphs
- Independent domatic partitioning or fall coloring of strongly chordal graphs
- Title not available (Why is that?)
- On idomatic partitions of direct products of complete graphs
- Idomatic partitions of direct products of complete graphs
- Title not available (Why is that?)
- Some problems on idomatic partitions and \(b\)-colorings of direct products of complete graphs
- Independent dominating sets in graphs of girth five
Cited In (4)
This page was built for publication: On graph fall-coloring: existence and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287754)
