AbstractUsing an idea due to P. Duchet in proving his well-known theorem on powers of chordal graphs, we shall describe some theorems of Duchet-type for powers of graphs that have no long induced cycles. In particular, our Duchet-type theorem for HHD-free graphs improves a recent result due to Dragan, Nicolai and Brandstädt; stating that odd powers of HHD-free graphs are also HHD-free
AbstractIt is proved that if G is a triangle-free graph with v vertices whose independence number do...
A digraph is H-free if its underlying graph does not contain a subgraph contractible to the graph H....
AbstractIn 1980, Piere Duchet conjectured that odd-directed cycles are the only edge minimal kernel-...
AbstractUsing an idea due to P. Duchet in proving his well-known theorem on powers of chordal graphs...
The k-th power of a graph G is the graph with the same vertex set as G where two vertices are adjace...
Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length...
Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length...
Let k be an integer and k ≥ 3. A graph G is k-chordal if G does not have an induced cycle of length ...
AbstractPowers of distance-hereditary graphs need not be distance-hereditary, but they come close: t...
A graph is HHD-free is it does not contain a house (i.e., the complement of P 5), a hole (a cycle of...
AbstractIn 1980, Piere Duchet conjectured that odd-directed cycles are the only edge minimal kernel-...
Abst ract. A graph is HHD-free is it does not contain a house (i.e., the complement of Ps), a hole (...
AbstractLet ccp denote the class of cocomparability graphs. We characterize ccp by a distance inequa...
A graph is HHD-free is it does not contain a house (i.e., the complement of P 5), a hole (a cycle of...
AbstractWe construct a directed graph G such that (a) G is strongly connected, (b) G has the circula...
AbstractIt is proved that if G is a triangle-free graph with v vertices whose independence number do...
A digraph is H-free if its underlying graph does not contain a subgraph contractible to the graph H....
AbstractIn 1980, Piere Duchet conjectured that odd-directed cycles are the only edge minimal kernel-...
AbstractUsing an idea due to P. Duchet in proving his well-known theorem on powers of chordal graphs...
The k-th power of a graph G is the graph with the same vertex set as G where two vertices are adjace...
Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length...
Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length...
Let k be an integer and k ≥ 3. A graph G is k-chordal if G does not have an induced cycle of length ...
AbstractPowers of distance-hereditary graphs need not be distance-hereditary, but they come close: t...
A graph is HHD-free is it does not contain a house (i.e., the complement of P 5), a hole (a cycle of...
AbstractIn 1980, Piere Duchet conjectured that odd-directed cycles are the only edge minimal kernel-...
Abst ract. A graph is HHD-free is it does not contain a house (i.e., the complement of Ps), a hole (...
AbstractLet ccp denote the class of cocomparability graphs. We characterize ccp by a distance inequa...
A graph is HHD-free is it does not contain a house (i.e., the complement of P 5), a hole (a cycle of...
AbstractWe construct a directed graph G such that (a) G is strongly connected, (b) G has the circula...
AbstractIt is proved that if G is a triangle-free graph with v vertices whose independence number do...
A digraph is H-free if its underlying graph does not contain a subgraph contractible to the graph H....
AbstractIn 1980, Piere Duchet conjectured that odd-directed cycles are the only edge minimal kernel-...