Local equivalence classes of distance-hereditary graphs using split decompositions

DOI10.1088/1751-8121/AEA45DMaRDI QIDQ7409754zbMATH OpenFDO

Authors Nicholas Connolly, Shin Nishio, K. Nemoto

Publication date 2026

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1751-8121/AEA45D

zbMATH Keywords

clique-starscomplete multipartitedistance-hereditary graphsgraph local equivalencelocal complementrepeater graphssplit decomposition

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• (k,+)-distance-hereditary graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• A Combinatorial Decomposition Theory
• An efficient algorithm to recognize locally equivalent graphs
• An O(n2) Algorithm for Undirected Split Decomposition
• Approximating clique-width and branch-width
• Circle graph obstructions
• Completely separable graphs
• Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
• Decomposition of Directed Graphs
• Digraph Decompositions and Eulerian Systems
• Distance labeling scheme and split decomposition
• Distance-hereditary graphs
• Dynamic Distance Hereditary Graphs Using Split Decomposition
• Graphic presentations of isotropic systems
• scientific article; zbMATH DE number 432772 (Why is no real title available?)
• scientific article; zbMATH DE number 15493 (Why is no real title available?)
• scientific article; zbMATH DE number 2077119 (Why is no real title available?)
• Linear time split decomposition revisited
• Multiparty entanglement in graph states
• On an estimate of the chromatic class of a \(p\)-graph
• Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
• Rank-width and vertex-minors
• Rank-width: algorithmic and structural results
• Recognition of Circle Graphs
• Recognizing circle graphs in polynomial time
• Recognizing locally equivalent graphs
• Reducing prime graphs and recognizing circle graphs
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
• Stabilizer codes can be realized as graph codes
• The complexity of the vertex-minor problem
• Transforming graph states using single-qubit operations
• Transforming trees by successive local complementations

This page was built for publication: Local equivalence classes of distance-hereditary graphs using split decompositions

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