Computing the clique number of \(a\)-perfect graphs in polynomial time

DOI10.1016/j.ejc.2013.06.025zbMath1292.05209OpenAlexW4393999799MaRDI QIDQ2509770

Annegret K. Wagler, Arnaud Pêcher

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://hal.science/hal-00920846

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Related Items (1)

On circular-perfect graphs: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing clique and chromatic number of circular-perfect graphs in polynomial time
• Triangle-free strongly circular-perfect graphs
• Polytope des independants d'un graphe série-parallèle
• The ellipsoid method and its consequences in combinatorial optimization
• A class of facet producing graphs for vertex packing polyhedra
• On certain polytopes associated with graphs
• Antiwebs are rank-perfect
• Applying Lehman's theorems to packing problems
• On rank-perfect subclasses of near-bipartite graphs
• Anti-blocking polyhedra
• Clique and chromatic number of circular-perfect graphs
• On determining the imperfection ratio
• Circular-imperfection of triangle-free graphs
• Star chromatic number
• On the Shannon capacity of a graph
• Circular perfect graphs
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: Computing the clique number of \(a\)-perfect graphs in polynomial time