International audienceWe consider the class of Berge graphs that do not contain a chordless cycle of length 4. We present a purely graph-theoretical algorithm that produces an optimal coloring in polynomial time for every graph in that class
We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consis...
AbstractIn this paper, we present a new class of graphs named weakly diamond-free (WDF) graphs and w...
International audienceA \emph{unichord} in a graph is an edge that is the unique chord of a cycle. A...
International audienceWe consider the class of Berge graphs that do not contain a chordless cycle of...
International audienceWe consider the class of Berge graphs that do not contain a chordless cycle of...
International audienceWe consider the class of Berge graphs that do not contain a chordless cycle of...
We consider the class of Berge graphs that do not contain a chordless cycle of length $4$. We presen...
International audienceWe consider the class of Berge graphs that do not contain a chordless cycle of...
We consider the class of Berge graphs that do not contain an induced cycle of length four. We presen...
International audienceWe consider the class of Berge graphs that contain no odd prism and no square ...
International audienceWe consider the class of Berge graphs that contain no odd prism and no square ...
International audienceWe consider the class of graphs containing no odd hole, no odd antihole, and n...
International audienceWe consider the class of graphs containing no odd hole, no odd antihole, and n...
International audienceWe consider the class of graphs containing no odd hole, no odd antihole, and n...
International audienceWe consider the class of graphs containing no odd hole, no odd antihole, and n...
We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consis...
AbstractIn this paper, we present a new class of graphs named weakly diamond-free (WDF) graphs and w...
International audienceA \emph{unichord} in a graph is an edge that is the unique chord of a cycle. A...
International audienceWe consider the class of Berge graphs that do not contain a chordless cycle of...
International audienceWe consider the class of Berge graphs that do not contain a chordless cycle of...
International audienceWe consider the class of Berge graphs that do not contain a chordless cycle of...
We consider the class of Berge graphs that do not contain a chordless cycle of length $4$. We presen...
International audienceWe consider the class of Berge graphs that do not contain a chordless cycle of...
We consider the class of Berge graphs that do not contain an induced cycle of length four. We presen...
International audienceWe consider the class of Berge graphs that contain no odd prism and no square ...
International audienceWe consider the class of Berge graphs that contain no odd prism and no square ...
International audienceWe consider the class of graphs containing no odd hole, no odd antihole, and n...
International audienceWe consider the class of graphs containing no odd hole, no odd antihole, and n...
International audienceWe consider the class of graphs containing no odd hole, no odd antihole, and n...
International audienceWe consider the class of graphs containing no odd hole, no odd antihole, and n...
We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consis...
AbstractIn this paper, we present a new class of graphs named weakly diamond-free (WDF) graphs and w...
International audienceA \emph{unichord} in a graph is an edge that is the unique chord of a cycle. A...
DOI
Add to ORKG