Transforming trees by successive local complementations

DOI10.1002/JGT.3190120210MaRDI QIDQ3788053zbMATH OpenOpenAlexFDO

Authors André Bouchet

Publication date 1988

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

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

zbMATH Keywords

complementationdecompositiongraph transformationlocal equivalencetotally decomposable graphs

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 4014056
• scientific article; zbMATH DE number 1903379
• Compositions of tree series transformations
• Tree transformations defined by hypersubstitutions
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 845898
• scientific article; zbMATH DE number 17547
• Publication:3028362
• scientific article; zbMATH DE number 1894656
• scientific article; zbMATH DE number 522869

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Isotropic systems

Cited in

(35)

• From graph states to two-graph states
• Treelike comparability graphs
• Isotropic systems
• Transitivity of local complementation and switching on graphs.
• Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
• Distance-hereditary comparability graphs
• The average cut-rank of graphs
• Linear rank-width and linear clique-width of trees
• Rank-width: algorithmic and structural results
• Graphs of small rank-width are pivot-minors of graphs of small tree-width
• Rank-width and vertex-minors
• Distance-hereditary comparability graphs
• scientific article; zbMATH DE number 4014056 (Why is no real title available?)
• scientific article; zbMATH DE number 458918 (Why is no real title available?)
• scientific article; zbMATH DE number 4202305 (Why is no real title available?)
• scientific article; zbMATH DE number 26598 (Why is no real title available?)
• Polynomial-time recognition of clique-width 3 graphs
• scientific article; zbMATH DE number 808801 (Why is no real title available?)
• Tree pivot-minors and linear rank-width
• Matroids that classify forests
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
• Signed graphs and Hushimi trees
• A polynomial kernel for distance-hereditary vertex deletion
• Graphs with bounded induced distance
• Vertex-minors of graphs: a survey
• Word-representability of graphs with respect to split recomposition
• Tree pivot-minors and linear rank-width
• Recognizing locally equivalent graphs
• Characterization of double-arborescences and their minimum length word-representants
• Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs
• Reducing 2-qubit gate count for ZX-calculus based quantum circuit optimization
• Isotropic matroids. I: Multimatroids and neighborhoods
• Excluded vertex-minors for graphs of linear rank-width at most \(k\)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese

This page was built for publication: Transforming trees by successive local complementations

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