Loose cover of graphs

DOI10.1007/S11786-009-0010-0MaRDI QIDQ626957zbMATH OpenOpenAlexFDO

Authors 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

cyclesdominating setgraph embeddingloose cover of graphspaths

Mathematics Subject Classification ID

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

Recommendations

• Loose cover of graphs by a local structure
• Graph covering via shortest paths
• scientific article; zbMATH DE number 2081019
• Three ways to cover a graph
• scientific article; zbMATH DE number 1236360

Cites work

• A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
• A Study on r-Configurations---A Resource Assignment Problem on Graphs
• Covering regular graphs
• Dominating sets and domatic number of circular arc graphs
• Finding a Domatic Partition of an Interval Graph in Time $O(n)$
• scientific article; zbMATH DE number 1236360 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Linear algorithm for domatic number problem on interval graphs
• On the domatic number of interval graphs
• The Domatic Number Problem in Interval Graphs

Cited in

(1)

• Loose cover of graphs by a local structure

This page was built for publication: Loose cover of graphs

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