AbstractA graph is short-chroded (a.k.a. Raspail) if every odd cycle of length at least 5 has a short chord, which is a chord joining vertices distance 2 apart in the cycle. A subclass of short-chorded graphs, not contained in any of the known classes of perfect graphs, will be proved perfect
AbstractA graph G is said to have depth δ if every path of length δ + 1 is contained in a shortest c...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole of len...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole of len...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the g...
Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. ...
AbstractMeyniel proved that a graph G is perfect if every odd cycle of G with at least five vertices...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractShort cycle connectivity is a generalization of ordinary connectivity—two vertices have to b...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
AbstractWe present two classes of perfect graphs. The first class is defined through a construction ...
AbstractA graph G is said to have depth δ if every path of length δ + 1 is contained in a shortest c...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole of len...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole of len...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the g...
Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. ...
AbstractMeyniel proved that a graph G is perfect if every odd cycle of G with at least five vertices...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractShort cycle connectivity is a generalization of ordinary connectivity—two vertices have to b...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
AbstractWe present two classes of perfect graphs. The first class is defined through a construction ...
AbstractA graph G is said to have depth δ if every path of length δ + 1 is contained in a shortest c...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole of len...
International audienceWe consider the class A of graphs that contain no odd hole, no antihole of len...
DOI
Add to ORKG