Characterization and recognition of some opposition and coalition graph classes

DOI10.1016/j.dam.2015.06.007zbMath1350.05047arXiv1507.00557OpenAlexW2963569157MaRDI QIDQ344867

Thomas Podelleck, Van Bang Le

Publication date: 24 November 2016

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

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

zbMATH Keywords

perfect graphperfectly orderable graphcoalition graphone-in-one-out graphopposition graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Which claw-free graphs are perfectly orderable?
• The strong perfect graph theorem
• Bipolarizable graphs
• On the complexity of recognizing perfectly orderable graphs
• Distance-hereditary graphs
• All variations on perfectly orderable graphs
• Welsh-Powell opposition graphs
• On sources in comparability graphs, with applications
• Efficient graph representations
• Distance-hereditary comparability graphs
• Recognition of some perfectly orderable graph classes
• On the complexity of recognizing a class of perfectly orderable graphs
• On opposition graphs, coalition graphs, and bipartite permutation graphs
• Some classes of perfectly orderable graphs
• A simple nc recognition algorithm for welsh-powell opposition graphs
• Graph Classes: A Survey

This page was built for publication: Characterization and recognition of some opposition and coalition graph classes