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

DOI10.1002/JGT.20415zbMATH Open1209.05200OpenAlexW4233000640MaRDI QIDQ3553230FDOQ3553230

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

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

zbMATH Keywords

cardvertex-deleted subgraphreconstruction numberexamplescounter-examplesreconstruction conjecture

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)

Cites Work

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

Cited In (14)

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

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)