Transitive orientations in bull-reducible Berge graphs

DOI10.1016/j.dam.2010.05.011zbMath1213.05104arXiv0810.4522OpenAlexW2033622089MaRDI QIDQ531595

Frédéric Maffray, Cláudia Villela Maciel, Celina M. Herrera de Figueiredo

Publication date: 19 April 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.4522

zbMATH Keywords

comparability graphperfect graphcoloringbull-reducible graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of bull-free perfect graphs
• Weakly triangulated graphs
• The strong perfect graph theorem
• Bull-free Berge graphs are perfect
• Modular decomposition and transitive orientation
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• Efficient graph representations
• Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
• Algorithmic graph theory and perfect graphs
• Recognizing bull-free perfect graphs
• Recognizing Berge graphs
• Efficient and Practical Algorithms for Sequential Modular Decomposition
• Improved algorithms for weakly chordal graphs
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Optimizing Bull-Free Perfect Graphs
• The perfection and recognition of bull-reducible Berge graphs
• Algorithm Theory - SWAT 2004
• Transitiv orientierbare Graphen
• Flots et tensions dans un graphe
• On the structure of bull-free perfect graphs. II: The weakly chordal case
• Bull-free weakly chordal perfectly orderable graphs

This page was built for publication: Transitive orientations in bull-reducible Berge graphs