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

DOI10.1002/JGT.20415MaRDI QIDQ3553230zbMATH OpenOpenAlexFDO

Authors

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

cardcounter-examplesexamplesreconstruction conjecturereconstruction numbervertex-deleted subgraph

Mathematics Subject Classification ID

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

Recommendations

• On pairs of graphs having n-2 cards in common.
• Pairs of graphs having n-2 cards in common.
• Graphs with large paired-domination number
• Family sizes for complete multipartite graphs
• A family of multigraphs with large palette index
• Complete families of graphs
• Two new families of large compound graphs
• scientific article; zbMATH DE number 1161379
• Forbidden pairs with a common graph generating almost the same sets
• COMMON MULTIPLES OF COMPLETE GRAPHS

Cites work

• A congruence theorem for trees
• Almost every graph has reconstruction number three
• Graph reconstruction—a survey
• scientific article; zbMATH DE number 4154485 (Why is no real title available?)
• scientific article; zbMATH DE number 1051281 (Why is no real title available?)
• scientific article; zbMATH DE number 1151365 (Why is no real title available?)
• scientific article; zbMATH DE number 1952951 (Why is no real title available?)
• scientific article; zbMATH DE number 822735 (Why is no real title available?)
• scientific article; zbMATH DE number 2188393 (Why is no real title available?)
• On dichromatic polynomials
• On Representatives of Subsets
• The ally-reconstruction number of a tree with five or more vertices is three
• The degree sequence is reconstructible from \(n-1\) cards
• The reconstruction of maximal planar graphs. II: Reconstruction

Cited in

(15)

• A new approach to graph reconstruction using supercards
• Reconstructing the degree sequence of a sparse graph from a partial deck
• The size of a graph is reconstructible from any \(n-2\) cards
• Towards size reconstruction from fewer cards
• On pairs of graphs having n-2 cards in common.
• On reconstructing graphs from n - 2 cards
• Pairs of graphs having n-2 cards in common.
• Lexicographic products with high reconstruction numbers
• The adversary degree-associated reconstruction number of double-brooms
• Reconstructing graphs from a deck of all distinct cards
• Recognizing connectedness from vertex-deleted subgraphs
• Size reconstructibility of graphs
• Reconstruction from one labelled card and more
• Recognizing trees from incomplete decks
• Graphs with a common eigenvalue deck

Describes a project that uses

Uses Software

• nauty

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

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