Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/loose-cover-of-graphs-UIfitjt7yT
References (13)
-
Jan Kratochvíl, A. Proskurowski, J. Telle (1998)
On the Complexity of Graph Covering Problems -
A. Bertossi (1988)
On the Domatic Number of Interval GraphsInf. Process. Lett., 28
-
J. Kratochvil, A. Proskurowski, J. Telle (1998)
Complexity of graph covering problemsNord. J. Comput., 5
-
T. Haynes, S. Hedetniemi, P. Slater (1998)
Fundamentals of domination in graphs, 208
-
S. Fujita, M. Yamashita, T. Kameda (2000)
A Study on r-Configurations - A Resource Assignment Problem on GraphsSIAM J. Discret. Math., 13
-
T. Haynes, S. Hedetniemi, P. Slater (1998)
Domination in graphs : advanced topics -
A. Rao, C. Rangan (1989)
Linear Algorithm for Domatic Number Problem on Interval GraphsInf. Process. Lett., 33
-
M. Bonuccelli (1985)
Dominating sets and domatic number of circular arc graphsDiscret. Appl. Math., 12
-
T. Lu, Pei-Hsin Ho, G. Chang (1990)
The Domatic Number Problem in Interval GraphsSIAM J. Discret. Math., 3
-
Sheng-Lung Peng, Maw-Shang Chang (1992)
A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal GraphsInf. Process. Lett., 43
-
Jan Kratochvíl, A. Proskurowski, J. Telle (1997)
Covering Regular GraphsJ. Comb. Theory, Ser. B, 71
-
G. Manacher, Terrance Mankus (1996)
Finding a Domatic Partition of an Interval Graph in Time O(n)SIAM J. Discret. Math., 9
-
A. Alan (1988)
On the domatic number of interval graphsInformation Processing Letters, 28
- Publisher
- Springer Journals
- Copyright
- Copyright © 2009 by Birkhäuser Verlag Basel/Switzerland
- Subject
- Mathematics; Mathematics, general; Computer Science, general
- ISSN
- 1661-8270
- eISSN
- 1661-8289
- DOI
- 10.1007/s11786-009-0010-0
- Publisher site
- See Article on Publisher Site
Abstract
This paper introduces a new definition of embedding a local structure to a given network, called loose cover of graphs. We derive several basic properties on the notion of loose cover, which includes transitivity, maximality, and the computational complexity of finding a loose cover by paths and cycles. In particular, we show that the decision problem is in P if the given local structure is a path with three or less vertices, while it is NP-complete for paths consisting of six or more vertices.
Journal
Mathematics in Computer Science – Springer Journals
Published: Nov 27, 2009