Loose cover of graphs

DOI10.1007/s11786-009-0010-0zbMath1205.05219OpenAlexW2047465598MaRDI QIDQ626957

Satoshi Fujita

Publication date: 19 February 2011

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-009-0010-0

zbMATH Keywords

pathscyclesdominating setgraph embeddingloose cover of graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating sets and domatic number of circular arc graphs
• On the domatic number of interval graphs
• A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
• Linear algorithm for domatic number problem on interval graphs
• Covering regular graphs
• A Study on r-Configurations---A Resource Assignment Problem on Graphs
• Finding a Domatic Partition of an Interval Graph in Time $O(n)$
• The Domatic Number Problem in Interval Graphs

This page was built for publication: Loose cover of graphs