Dually Chordal Graphs
From MaRDI portal
Publication:4210216
DOI10.1137/S0895480193253415zbMath0909.05037OpenAlexW2062210818MaRDI QIDQ4210216
Victor Chepoi, Andreas Brandstädt, Feodor F. Dragan, Vitaly I. Voloshin
Publication date: 21 September 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480193253415
characterizationschordal graphstree structureclique hypergraphsneighborhood hypergraphs precolation processes
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Related Items
Bootstrap percolation via automated conjecturing ⋮ Detour trees ⋮ Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ Computing the union join and subset graph of acyclic hypergraphs in subquadratic time ⋮ COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS ⋮ Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension ⋮ On basic chordal graphs and some of its subclasses ⋮ How to use spanning trees to navigate in graphs ⋮ Dominating cliques in distance-hereditary graphs ⋮ How to Use Spanning Trees to Navigate in Graphs ⋮ Injective hulls of various graph classes ⋮ On neighborhood-Helly graphs ⋮ Algorithmic aspects of open neighborhood location-domination in graphs ⋮ 3-colouring for dually chordal graphs and generalisations ⋮ Perfect elimination orderings for symmetric matrices ⋮ Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs ⋮ On the recognition of neighborhood inclusion posets ⋮ Restrained domination in some subclasses of chordal graphs ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ Split clique graph complexity ⋮ Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Complexity of total outer-connected domination problem in graphs ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ On Strong Tree-Breadth ⋮ Cycle intersection in spanning trees: a shorter proof of a conjecture and applications ⋮ Hypergraph LSS-ideals and coordinate sections of symmetric tensors ⋮ Subgraph trees in graph theory ⋮ Variations of maximum-clique transversal sets on graphs ⋮ Computing the hull number in \(\Delta \)-convexity ⋮ Revisiting Decomposition by Clique Separators ⋮ The complexity of secure domination problem in graphs ⋮ Algorithmic aspects of \(k\)-tuple total domination in graphs ⋮ Computing a minimum outer-connected dominating set for the class of chordal graphs ⋮ Global total \(k\)-domination: approximation and hardness results ⋮ On the correspondence between tree representations of chordal and dually chordal graphs ⋮ Characterization of classical graph classes by weighted clique graphs ⋮ The domination game played on unions of graphs ⋮ Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs ⋮ Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs ⋮ Variations of \(Y\)-dominating functions on graphs ⋮ On the complexity of computing treebreadth ⋮ On distance-preserving elimination orderings in graphs: complexity and algorithms ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings ⋮ On minimal vertex separators of dually chordal graphs: properties and characterizations ⋮ Hardness results, approximation and exact algorithms for liar's domination problem in graphs ⋮ On partial Grundy coloring of bipartite graphs and chordal graphs ⋮ From hypertrees to arboreal quasi-ultrametrics ⋮ On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\) ⋮ Unnamed Item ⋮ On the complexity of signed and minus total domination in graphs ⋮ Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees ⋮ Augmenting forests to meet odd diameter requirements ⋮ Maxclique and unit disk characterizations of strongly chordal graphs ⋮ Collective Additive Tree Spanners of Homogeneously Orderable Graphs ⋮ An improved algorithm for the longest induced path problem on \(k\)-chordal graphs ⋮ Special eccentric vertices for the class of chordal graphs and related classes ⋮ Clique-perfectness of complements of line graphs ⋮ Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width ⋮ The complexity of clique graph recognition ⋮ On the Complexity of Computing Treebreadth ⋮ Cube intersection concepts in median graphs ⋮ Split Clique Graph Complexity ⋮ The clique operator on cographs and serial graphs ⋮ Comparing trees characteristic to chordal and dually chordal graphs ⋮ Simplicial powers of graphs ⋮ Recognizing clique graphs of directed and rooted path graphs ⋮ Simplicial Powers of Graphs ⋮ A polynomial algorithm for the strong Helly property ⋮ Additive sparse spanners for graphs with bounded length of largest induced cycle ⋮ Augmenting Outerplanar Graphs to Meet Diameter Requirements ⋮ Intersection graphs of maximal hypercubes
This page was built for publication: Dually Chordal Graphs
