A note on a conjecture by Gavril on clique separable graphs

DOI10.1016/0012-365X(83)90127-9zbMath0513.05035WikidataQ123278189 ScholiaQ123278189MaRDI QIDQ1050357

J. Mark Keil, Derek Gordon Corneil

Publication date: 1983

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

zbMATH Keywords

clique separablecompletely connected cut-set

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items

\(K_ i\)-covers. I: Complexity and polytopes

Cites Work

• Complement reducible graphs
• Algorithms on clique separable graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on a conjecture by Gavril on clique separable graphs