Dually Chordal Graphs
From MaRDI portal
Recommendations
Cited in
(86)- Split clique graph complexity
- Cycle intersection in spanning trees: a shorter proof of a conjecture and applications
- Minimal vertex separators and new characterizations for dually chordal graphs
- Global total \(k\)-domination: approximation and hardness results
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
- The domination game played on unions of graphs
- Injective hulls of various graph classes
- The complexity of distance-r dominating set reconfiguration
- 3-colouring for dually chordal graphs and generalisations
- Dualizing chordal graphs
- Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
- Domination and packing in graphs
- Characterization of classical graph classes by weighted clique graphs
- Subgraph trees in graph theory
- Detour trees
- Maxclique and unit disk characterizations of strongly chordal graphs
- On partial Grundy coloring of bipartite graphs and chordal graphs
- Dually and strongly chordal graphs
- Simplicial powers of graphs
- A story of diameter, radius, and (almost) Helly property
- The complexity of secure domination problem in graphs
- Double-crossed chords and distance-hereditary graphs
- On the complexity of signed and minus total domination in graphs
- Augmenting outerplanar graphs to meet diameter requirements
- On distance-preserving elimination orderings in graphs: complexity and algorithms
- Dominating cliques in distance-hereditary graphs
- Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees
- Monomial ideals with minimal generalized Barile-Macchia resolutions
- On basic chordal graphs and some of its subclasses
- Cube intersection concepts in median graphs
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- The clique operator on cographs and serial graphs
- On the complexity of computing treebreadth
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
- On the complexity of computing treebreadth
- Perfect elimination orderings for symmetric matrices
- Complexity of certain functional variants of total domination in chordal bipartite graphs
- Hypergraph LSS-ideals and coordinate sections of symmetric tensors
- Bootstrap percolation via automated conjecturing
- Computing the hull number in -convexity
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- How to Use Spanning Trees to Navigate in Graphs
- On strong tree-breadth
- The complexity of distance-\(r\) dominating set reconfiguration
- Revisiting decomposition by clique separators
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- Constrained representations of map graphs and half-squares
- Special eccentric vertices for the class of chordal graphs and related classes
- How to use spanning trees to navigate in graphs
- On minimal vertex separators of dually chordal graphs: properties and characterizations
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Recognizing clique graphs of directed and rooted path graphs
- Fast algorithms of dually chordal graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\)
- Variations of maximum-clique transversal sets on graphs
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
- Minimum maximal acyclic matching in proper interval graphs
- Algorithmic aspects of open neighborhood location-domination in graphs
- On neighborhood-Helly graphs
- The complexity of clique graph recognition
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- Dual filtered graphs
- Beyond Helly graphs: the diameter problem on absolute retracts
- Restrained domination in some subclasses of chordal graphs
- On the correspondence between tree representations of chordal and dually chordal graphs
- Simplicial Powers of Graphs
- Augmenting forests to meet odd diameter requirements
- Distance problems within Helly graphs and \(k\)-Helly graphs
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- Split clique graph complexity
- Comparing trees characteristic to chordal and dually chordal graphs
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs
- scientific article; zbMATH DE number 1743828 (Why is no real title available?)
- Complexity of total outer-connected domination problem in graphs
- On the recognition of neighborhood inclusion posets
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Clique-perfectness of complements of line graphs
- Variations of \(Y\)-dominating functions on graphs
- From hypertrees to arboreal quasi-ultrametrics
- A polynomial algorithm for the strong Helly property
- Intersection graphs of maximal hypercubes
This page was built for publication: Dually Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210216)
