Recognition of quasi-Meyniel graphs

DOI10.1016/S0166-218X(00)00290-0zbMath1001.68089MaRDI QIDQ5951967

Celina M. Herrera de Figueiredo, Kristina Vušković

Publication date: 2001

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

zbMATH Keywords

polynomial-time algorithmquasi-Meyniel graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for coloring Meyniel graphs
• Short-chorded and perfect graphs
• On the complexity of testing for odd holes and induced odd paths
• Universally signable graphs
• Even and odd holes in cap-free graphs
• HOLES AND DOMINOES IN MEYNIEL GRAPHS

This page was built for publication: Recognition of quasi-Meyniel graphs