Spanning subgraphs of graphs partitioned into two isomorphic pieces

DOI10.1002/JGT.20123MaRDI QIDQ3376694zbMATH OpenOpenAlexFDO

Authors Anthony Bonato

Publication date 24 March 2006

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

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

zbMATH Keywords

local propertymatchingncc graphpolynomial time algorithmpseudo-homogeneous graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Partitioning a graph into two isomorphic pieces
• Partitioning a graph into two pieces, each isomorphic to the other or to its complement
• Recognizing global occurrence of local properties
• Graphs with two isomorphism classes of spanning unicycle subgraphs
• On graphs with prescribed subgraphs of order k, and a theorem of Kelly and Merriell

Cites work

• scientific article; zbMATH DE number 1944718 (Why is no real title available?)
• Paths, Trees, and Flowers
• The random graph
• Tournaments and Orders with the Pigeonhole Property

Cited in

(2)

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

This page was built for publication: Spanning subgraphs of graphs partitioned into two isomorphic pieces

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