A characterisation of rigid circuit graphs
From MaRDI portal
Publication:1846437
Cites work
Cited in
(only showing first 100 items - show all)- Some aspects of the semi-perfect elimination
- Chordal graphs and their clique graphs
- Perfect edge domination and efficient edge domination in graphs
- Intersection models of weakly chordal graphs
- The forbidden subgraph characterization of directed vertex graphs
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
- Two strikes against perfect phylogeny
- Characterization and representation problems for intersection betweennesses
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- Vertex ordering characterizations of graphs of bounded asteroidal number
- Intersection graphs of vertex disjoint paths in a tree
- On compatibility and incompatibility of collections of unrooted phylogenetic trees
- Minimizing phylogenetic number to find good evolutionary trees
- Minimal triangulations of graphs: a survey
- Minimal elimination of planar graphs
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Algorithms and complexity of sandwich problems in graphs (extended abstract)
- Minimal elimination ordering for graphs of bounded degree
- A vertex incremental approach for maintaining chordality
- Counting the number of independent sets in chordal graphs
- Representation characterizations of chordal bipartite graphs
- The complexity of reconstructing trees from qualitative characters and subtrees
- Approximation and kernelization for chordal vertex deletion
- Hypergraphes arbores
- What Is between Chordal and Weakly Chordal Graphs?
- Treewidth computations. I: Upper bounds
- Linear-time algorithms for tree root problems
- Finding intersection models: from chordal to Helly circular-arc graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Intersection graphs of paths in a tree
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- On some simplicial elimination schemes for chordal graphs
- Peakless functions on graphs
- Maximal sub-triangulation in pre-processing phylogenetic data
- A faster algorithm to recognize undirected path graphs
- The vertex leafage of chordal graphs
- Simplicial decompositions of graphs: A survey of applications
- Extending cycles in graphs
- Locational analysis
- Constant tolerance intersection graphs of subtrees of a tree
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- Information storage and retrieval - mathematical foundations. II: Combinatorial problems
- Tree reconstruction from multi-state characters
- Perfect elimination orderings of chordal powers of graphs
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Graph minors. V. Excluding a planar graph
- Intersection representations of matrices by subtrees and unicycles on graphs
- Representing edge intersection graphs of paths on degree 4 trees
- Recognizing clique graphs of directed and rooted path graphs
- Linear-time generation of random chordal graphs
- Fast compatibility testing for rooted phylogenetic trees
- Some aspects of perfect elimination orderings in chordal graphs
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Interval graphs and related topics
- Combining polynomial running time and fast convergence for the disk-covering method.
- Clique tree generalization and new subclasses of chordal graphs
- Trivially perfect graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Identifying phylogenetic trees
- Tree representations of graphs
- On the complexity of computing treelength
- On compact and efficient routing in certain graph classes
- Reduced clique graphs of chordal graphs
- On the pathwidth of chordal graphs
- Diameter determination on restricted graph families
- A Class of Balanced Matrices Arising from Location Problems
- On the representation of triangulation graphs in trees
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- A Characterisation of the Minimal Triangulations of Permutation Graphs
- Two characterisations of the minimal triangulations of permutation graphs
- Induced matchings
- Treewidth computation and extremal combinatorics
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- Separator orders in interval, cocomparability, and AT-free graphs
- Moplex orderings generated by the LexDFs algorithm
- The \(k\)-edge intersection graphs of paths in a tree
- The clique-separator graph for chordal graphs
- Convex tree realizations of partitions
- Graph triangulations and the compatibility of unrooted phylogenetic trees
- Chordal digraphs
- Polynomially bounded algorithms for locatingp-centers on a tree
- Complexity of distance paired-domination problem in graphs
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- An efficient algorithm for counting Markov equivalent DAGs
- NP-complete problems simplified on tree schemas
- Completeness for intersection classes
- Cycle-free partial orders and chordal comparability graphs
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs
- Brambles and independent packings in chordal graphs
- Mathematical approaches to comparative linguistics
- Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
- A note on \(r\)-dominating cliques
- Multiplicity adjustment for temporal and spatial scan statistics using Markov property
- Characterizing intersection classes of graphs
- The parallel solution of domination problems on chordal and strongly chordal graphs
- scientific article; zbMATH DE number 7310078 (Why is no real title available?)
- Exact leaf powers
- Junction trees of general graphs
This page was built for publication: A characterisation of rigid circuit graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1846437)
