Aug 1, 2003 · In this paper, we investigate structure properties and algorithmic implications of the (claw, net)-free graphs (CN-free graphs, for short)
We prove that every (claw, net)-free graph contains an induced doubly dominating cycle or a dominating pair. Moreover, using LexBFS we present a linear time ...
We prove that every (claw, net)-free graph contains an induced doubly dominating cycle or a dominating pair. Moreover, using LexBFS we present a linear time ...
People also ask
What is the structure of a claw free graph?
What is the difference between a linear and a line graph?
On linear and circular structure of (claw, net)-free graph. To appear in ... Linear time algorithms for the Hamiltonian problems on (claw,net)-free graphs
It is shown that every connected claw-free graph can be obtained from one of the basic claw- free graphs by simple expansion operations.
Linear interval graphs are defined in the same way, taking C to be a line instead of a circle. Every linear interval graph is also a circular interval graph.
Missing: net | Show results with:net
On linear and circular structure of (claw, net)-free graph. To appear in Discrete Appl. Math. [1610]. A. Brandstaedt, F.F. Dragan, E. Koehler Linear time ...
Construct a graph as follows. Take a circle, and a collection of intervals from it, no three of which have union the entire circle; take a finite set of ...
Brandstädt and F.F. Dragan, On linear and circular structure of (claw, net)-free graphs, Discrete Appl. Math. 129 (2003) 285-303, doi: 10.1016/S0166-218X(02) ...
On Linear and Circular Structure of (Claw, Net)-Free Graphs. Discrete Applied Mathematics · Combinatorics Applied Mathematics Discrete Mathematics · 2003 ...