Christian Rubio-Montiel

A new characterization of trivially perfect graphs

A graph G is trivially perfect if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number) α(G) equals the number of (maximal) cliques m(G). We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.

A note on m-factorizations of complete multigraphs arising from designs

Some new infinite families of simple, indecomposable m -factorizations of the complete multigraph λK v are presented. Most of the constructions come from finite geometries.

The ωψ-perfection of graphs

Abstract In this paper we study a natural generalization for the perfection of graphs to other interesting parameters related with colorations. This generalization was introduced partially by Christen and Selkow in 1979 and Yegnanarayanan in 2001. Let a , b ∈ { ω , χ , Γ , α , ψ } where ω is the clique number, χ is the chromatic number, Γ is the Grundy number, α is the achromatic number and ψ is the pseudoachromatic number. A graph G is ab-perfect if for every induced subgraph H, a ( H ) = b ( H ) . In this work we characterize the ωψ-perfect graphs.

On the Pseudoachromatic Index of the Complete Graph III

An edge colouring of a graph G is complete if for any distinct colours

The Hadwiger number, chordal graphs and ab-perfection

c_1

The Erd{\Ho}s-Faber-Lov\'asz conjecture for geometric graphs

c1 and

On the 4-girth-thickness of the line graph of the complete graph

c_2