New classes of perfectly orderable graphs

DOI10.1016/S0012-365X(00)00434-9MaRDI QIDQ5959094zbMATH OpenOpenAlexFDO

Authors Jean-Luc Fouquet, F. Roussel, P. Rubio, Henri Thuillier

Publication date 30 July 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00434-9

zbMATH Keywords

charming graphsgreedy algorithmperfectly orderable graphsquasi-brittle graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Some classes of perfectly orderable graphs
• Quasi-brittle graphs, a new class of perfectly orderable graphs
• Perfectly orderable graphs: A survey
• Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
• Four classes of perfectly orderable graphs

Cited in

(20)

• Perfectly orderable graphs are quasi-parity graphs: a short proof
• Generalized neighbourhoods and a class of perfectly orderable graphs
• Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
• New properties of perfectly orderable graphs and strongly perfect graphs
• A charming class of perfectly orderable graphs
• Properly orderable graphs
• A note on perfectly orderable graphs
• On the complexity of recognizing a class of perfectly orderable graphs
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
• Quasi-brittle graphs, a new class of perfectly orderable graphs
• Perfectly orderable graphs: A survey
• scientific article; zbMATH DE number 3885965 (Why is no real title available?)
• Perfectly orderable graphs and unique colorability
• scientific article; zbMATH DE number 4045795 (Why is no real title available?)
• Four classes of perfectly orderable graphs
• Some classes of perfectly orderable graphs
• On the perfect orderability of unions of two graphs
• Partial characterizations of 1-perfectly orientable graphs
• Which claw-free graphs are perfectly orderable?
• On the complexity of recognizing perfectly orderable graphs

This page was built for publication: New classes of perfectly orderable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959094)