On the structure of self-complementary graphs

DOI10.1016/j.endm.2005.06.014zbMath1182.05103arXiv1308.6139OpenAlexW2073931908MaRDI QIDQ3439312

Nicolas Trotignon

Publication date: 29 May 2007

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

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

zbMATH Keywords

graphdecompositionself-complementary

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Star-cutsets and perfect graphs
• Compositions for perfect graphs
• Selbstkomplementäre Graphen
• Complexity of graph partition problems
• FindingH-partitions efficiently
• On the completeness of a generalized matching problem
• Berge trigraphs
• Self-complementary graphs

This page was built for publication: On the structure of self-complementary graphs