Characterizations of strongly chordal graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- Domination, independent domination, and duality in strongly chordal graphs
- Hypergraphs with no special cycles
- On rigid circuit graphs
- Parallel concepts in graph theory
- Properties of (0,1)-matrices with no triangles
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Totally-Balanced and Greedy Matrices
- Triangulated graphs and the elimination process
Cited in
(only showing first 100 items - show all)- On Injective Colourings of Chordal Graphs
- Strong Chordality of Graphs with Possible Loops
- Dominating cliques in chordal graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Semi-dynamic algorithms for strongly chordal graphs
- On the complexity of variations of mixed domination on graphs
- Representation characterizations of chordal bipartite graphs
- Requiring chords in cycles
- Minimal elimination ordering for graphs of bounded degree
- Monge and feasibility sequences in general flow problems
- Totally-Balanced and Greedy Matrices
- One-sided discrete terrain guarding and chordal graphs
- On the terminal connection problem
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs
- Broadcast domination and multipacking in strongly chordal graphs
- String graphs of k-bend paths on a grid
- Weighted maximum-clique transversal sets of graphs
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- The domatic number of block-cactus graphs
- Perfect circular arc coloring
- Labeling algorithms for domination problems in sun-free chordal graphs
- Efficient \((j, k)\)-dominating functions
- Characterizing and computing the structure of clique intersections in strongly chordal graphs
- Odd twists on strongly chordal graphs
- The parallel complexity of elimination ordering procedures
- Recognizing threshold tolerance graphs in O(n^2) time
- An approximation result for the interval coloring problem on claw-free chordal graphs
- A characterization of totally balanced hypergraphs
- On probe permutation graphs
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
- The domatic number problem on some perfect graph families
- Subgraph trees in graph theory
- On the computational difficulty of the terminal connection problem
- A survey on pairwise compatibility graphs
- Boxicity of leaf powers
- Chordal bipartite graphs with high boxicity
- Counting perfect matchings and the switch chain
- Signed and minus clique-transversal functions on graphs
- Chordal bipartite completion of colored graphs
- Alternating cycle-free matchings
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- Maxclique and unit disk characterizations of strongly chordal graphs
- Diameter determination on restricted graph families
- Labelled packing functions in graphs
- Exact leaf powers
- Simplicial powers of graphs
- Regular codes in regular graphs are difficult
- Covering all cliques of a graph
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
- A note on perfectly orderable graphs
- On hypergraph acyclicity and graph chordality
- The weakly connected independent set polytope in corona and join of graphs
- A characterization of strongly chordal graphs
- The degree-preserving spanning tree problem in strongly chordal and directed path graphs
- An approximation algorithm for clustering graphs with dominating diametral path
- On the complexity of signed and minus total domination in graphs
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- Strong elimination ordering of the total graph of a tree
- Further results on Hendry's Conjecture
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- The recognition of geodetically connected graphs
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs
- On basic chordal graphs and some of its subclasses
- Gallai-like characterization of strong cocomparability graphs
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
- Koszul graded Möbius algebras and strongly chordal graphs
- Pairwise compatibility graphs: a survey
- L(2,1)-labeling of perfect elimination bipartite graphs
- Min-orderable digraphs
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
- scientific article; zbMATH DE number 2024687 (Why is no real title available?)
- The algorithmic complexity of mixed domination in graphs
- From a simple elimination ordering to a strong elimination ordering in linear time
- Domination, independent domination, and duality in strongly chordal graphs
- Regular vines with strongly chordal pattern of (conditional) independence
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
- A linear time algorithm for finding all hinge vertices of a permutation graph
- Domination in convex and chordal bipartite graphs
- A new characterization of strongly chordal graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Induced matchings
- Algorithms for generating strongly chordal graphs
- A good characterization of squares of strongly chordal split graphs
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Clique graphs and Helly graphs
- Complexity analysis of triangular decomposition over F₂ with strongly chordal graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Upper maximal graphs of posets
- On some graph classes related to perfect graphs: a survey
- Arboricity, \(h\)-index, and dynamic algorithms
- Matching and multidimensional matching in chordal and strongly chordal graphs
- Tree spanners on chordal graphs: complexity and algorithms
- On edge perfectness and classes of bipartite graphs
- Special eccentric vertices for the class of chordal graphs and related classes
- Restricted unimodular chordal graphs
- Finding the minimum bandwidth of an interval graph
This page was built for publication: Characterizations of strongly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1051004)
