Partitioning a graph into two pieces, each isomorphic to the other or to its complement

DOI10.1016/j.disc.2005.04.019zbMath1081.05093OpenAlexW2045723981MaRDI QIDQ2576840

Miri Priesler

Publication date: 29 December 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.04.019

zbMATH Keywords

partitionisomorphic graphscomplement graphsgncc graphncc graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Partitioning a graph into two isomorphic pieces
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioning a graph into two pieces, each isomorphic to the other or to its complement