Dually chordal graphs

DOI10.1007/3-540-57899-4_56MaRDI QIDQ6143980zbMATH OpenOpenAlexFDO

Authors Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, V. I. Voloshin

Publication date 5 January 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57899-4_56

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A characterisation of rigid circuit graphs
• A characterization of totally balanced hypergraphs
• Absolute reflexive retracts and absolute bipartite retracts
• Absolute retracts of bipartite graphs
• Algorithmic aspects of intersection graphs and representation hypergraphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Characterizations of strongly chordal graphs
• Characterizations of totally balanced matrices
• Chordality properties on graphs and minimal conceptual connections in semantic data models
• Classes of bipartite graphs related to chordal graphs
• Clique graphs and Helly graphs
• Clique Graphs of Chordal and Path Graphs
• Degrees of acyclicity for hypergraphs and relational database schemes
• Doubly chordal graphs, steiner trees, and connected domination
• Doubly Lexical Orderings of Matrices
• Graphs whose neighborhoods have no special cycles
• Hereditary modular graphs
• scientific article; zbMATH DE number 3889566 (Why is no real title available?)
• scientific article; zbMATH DE number 3843458 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3914360 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 175723 (Why is no real title available?)
• scientific article; zbMATH DE number 3641484 (Why is no real title available?)
• scientific article; zbMATH DE number 468643 (Why is no real title available?)
• Hypergraphes arbores
• Incidence matrices and interval graphs
• On hypergraph acyclicity and graph chordality
• On rigid circuit graphs
• On the Desirability of Acyclic Database Schemes
• Perfect Elimination and Chordal Bipartite Graphs
• Polynomially bounded algorithms for locatingp-centers on a tree
• Pseudo-modular graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Syntactic Characterization of Tree Database Schemas
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Three Partition Refinement Algorithms
• Totally-Balanced and Greedy Matrices

Cited in

(6)

• Dual filtered graphs
• Dualizing chordal graphs
• Double-crossed chords and distance-hereditary graphs
• Dually and strongly chordal graphs
• LexBFS-orderings and powers of graphs
• Homogeneous sets and domination problems

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 Q6143980)