Partitioning a graph into two isomorphic pieces

DOI10.1002/JGT.10121MaRDI QIDQ4434545zbMATH OpenOpenAlexFDO

Authors 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

co-neighbour setgraphmatchingneighbour setregular graph

Mathematics Subject Classification ID

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

Recommendations

• Partitioning a graph into two pieces, each isomorphic to the other or to its complement
• scientific article; zbMATH DE number 4021173
• Spanning subgraphs of graphs partitioned into two isomorphic pieces
• On graphs with prescribed subgraphs of order k, and a theorem of Kelly and Merriell
• Graphs with isomorphic neighbor-subgraphs

Cited in

(4)

• Partitioning a graph into two pieces, each isomorphic to the other or to its complement
• Spanning subgraphs of graphs partitioned into two isomorphic pieces
• Cutting a graph into two dissimilar halves
• scientific article; zbMATH DE number 7101993 (Why is no real title available?)

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)