Laminar structure of ptolemaic graphs with applications
From MaRDI portal
(Redirected from Publication:1028126)
Recommendations
- Axiomatic characterizations of Ptolemaic and chordal graphs
- Combinatorial and geometric properties of planar Laman graphs
- scientific article; zbMATH DE number 4081597
- Ptolemaic and planar cover-incomparability graphs
- A structural theorem for planar graphs with some applications
- Geometric graphs in the plane lattice
- On the geometry and Laplacian of a graph
- scientific article; zbMATH DE number 4123780
- Lattice structures from planar graphs
Cites work
- scientific article; zbMATH DE number 477971 (Why is no real title available?)
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A Linear Recognition Algorithm for Cographs
- A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
- A characterization of ptolemaic graphs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
- A simple linear time LexBFS cograph recognition algorithm.
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Centers and medians of distance-hereditary graphs
- Combinatorial optimization. Theory and algorithms
- Completely separable graphs
- Degrees of acyclicity for hypergraphs and relational database schemes
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Distance-hereditary graphs
- Domination in distance-hereditary graphs
- Efficient Parallel Algorithms for Chordal Graphs
- Efficient graph representations
- Graph Classes: A Survey
- Graph-Theoretic Concepts in Computer Science
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- Independent domination in chordal graphs
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- On hypergraph acyclicity and graph chordality
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The Hamiltonian problem on distance-hereditary graphs
Cited in
(15)- scientific article; zbMATH DE number 7765420 (Why is no real title available?)
- On the Galois lattice of bipartite distance hereditary graphs
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
- Algorithms and Computation
- Polynomial time algorithms for variants of graph matching on partial k-trees
- Clique graph representations of Ptolemaic graphs
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
- Shared ancestry graphs and symbolic arboreal maps
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
- Recognition of Probe Ptolemaic Graphs
- New results on Ptolemaic graphs
- Intersection of longest paths in graph classes
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
This page was built for publication: Laminar structure of ptolemaic graphs with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028126)
