We study the P4-tidy graphs, a new class defined by Rusu [30] in order to illustrate the notion of P4-domination in perfect graphs. This class strictly contains the P4-extendible graphs and theâ€¦ (More)

For terms not defined here, the reader is referred to [6]. For a graph G=(V, E), we denote by G the complement of G. We use |(G) to denote the size of a largest clique in G and :(G) to denote theâ€¦ (More)

The Strong Perfect Graph Conjecture (SPGC) was certainly one of the most challenging conjectures in graph theory. During more than four decades, numerous attempts were made to solve it, byâ€¦ (More)

The scattering number of a graph G equals max{c(G\S) ISI 1 S is a cutset of G} where c(G\S) denotes the number of connected components in G\S. Jung (1978) has given for any graph having no inducedâ€¦ (More)

We show that i-triangulated graphs can be colored in linear time by applying lexicographic breadth-first search (abbreviated LexBFS) and the greedy coloring algorithm.