Restricted unimodular chordal graphs
From MaRDI portal
Publication:4229266
DOI<121::AID-JGT6>3.0.CO;2-1 10.1002/(SICI)1097-0118(199902)30:2<121::AID-JGT6>3.0.CO;2-1zbMath0912.05044OpenAlexW4240389170MaRDI QIDQ4229266
Publication date: 9 May 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199902)30:2<121::aid-jgt6>3.0.co;2-1
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (4)
On the Galois Lattice of Bipartite Distance Hereditary Graphs ⋮ ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES ⋮ Block duplicate graphs and a hierarchy of chordal graphs ⋮ On the Galois lattice of bipartite distance hereditary graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- A hierarchy of totally unimodular matrices
- Characterizations of strongly chordal graphs
- Neighborhood perfect graphs
- New linear time algorithms for generating perfect elimination orderings of chordal graphs
- A characterisation of rigid circuit graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- On a Class of Totally Unimodular Matrices
- Structural properties and recognition of restricted and strongly unimodular matrices
- A characterization of ptolemaic graphs
- A sufficient condition for a matrix to be totally unimodular
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
This page was built for publication: Restricted unimodular chordal graphs