Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction

DOI10.1007/978-3-540-69733-6_42MaRDI QIDQ3511354zbMATH OpenOpenAlexFDO

Authors Masaya Mito, Satoshi Fujita

Publication date 10 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69733-6_42

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Domatic Partition on Several Classes of Graphs
• The domatic number problem on some perfect graph families
• On the domatic number of interval graphs
• The Domatic Number Problem in Interval Graphs
• Partitioning vertices into in- and out-dominating sets in digraphs

This page was built for publication: Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction

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