Graphs isomorphisms under edge-replacements and the family of amoebas
From MaRDI portal
Publication:6133145
DOI10.37236/11876zbMath1519.05175arXiv2007.11769MaRDI QIDQ6133145
Adriana Hansberg, Amanda Montejano, Yair Caro
Publication date: 18 August 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.11769
Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of reconfiguration problems
- Classification algorithms for codes and designs
- Reconstructing under group actions.
- An intermediate value theorem for the decycling numbers of Toeplitz graphs
- Combinatorial reconstruction problems
- Interpolation theorems for graphs, hypergraphs and matroids
- 2-swappable graphs
- Interpolation theorems on graph parameters
- Token graphs
- Bounds for graph regularity and removal lemmas
- Automorphism groups of a graph and a vertex-deleted subgraph
- On zero-sum spanning trees and zero-sum connectivity
- The number of switching isomorphism classes of signed graphs associated with particular graphs
- The connectivity of token graphs
- Practical graph isomorphism. II.
- Switchings, realizations, and interpolation theorems for graph parameters
- On an interpolation property of outerplanar graphs
- Topics in Graph Automorphisms and Reconstruction
- Interpolation theorem for diameters of spanning trees
- Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
- Switching techniques for edge decompositions of graphs
- Graph isomorphism in quasipolynomial time [extended abstract]
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- No Graph is Perfect
- Bounds for the chromatic number of a graph
- Reconfigurations in Graphs and Grids
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
This page was built for publication: Graphs isomorphisms under edge-replacements and the family of amoebas
