Families of pairs of graphs with a large number of common cards

DOI10.1002/jgt.20415zbMath1209.05200OpenAlexW4233000640MaRDI QIDQ3553230

No author found.

Publication date: 22 April 2010

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

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

zbMATH Keywords

cardreconstruction conjectureexamplesvertex-deleted subgraphreconstruction numbercounter-examples

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Reconstructing the degree sequence of a sparse graph from a partial deck ⋮ The size of a graph is reconstructible from any \(n-2\) cards ⋮ Size reconstructibility of graphs ⋮ Lexicographic products with high reconstruction numbers ⋮ The adversary degree-associated reconstruction number of double-brooms ⋮ Recognizing connectedness from vertex-deleted subgraphs

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• The degree sequence is reconstructible from \(n-1\) cards
• The reconstruction of maximal planar graphs. II: Reconstruction
• Almost every graph has reconstruction number three
• The ally-reconstruction number of a tree with five or more vertices is three
• Graph reconstruction—a survey
• On Representatives of Subsets
• On dichromatic polynomials

This page was built for publication: Families of pairs of graphs with a large number of common cards