Partitioning a graph into two isomorphic pieces

DOI10.1002/JGT.10121zbMATH Open1028.05084OpenAlexW4237624345MaRDI QIDQ4434545

Anthony Bonato, R. J. Nowakowski

Publication date: 10 November 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10121

zbMATH Keywords

graphmatchingregular graphco-neighbour setneighbour set

Mathematics Subject Classification ID

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

Related Items (3)

Title not available (Why is that?) ⋮ Cutting a graph into two dissimilar halves ⋮ Partitioning a graph into two pieces, each isomorphic to the other or to its complement

This page was built for publication: Partitioning a graph into two isomorphic pieces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434545)