Publication:4229266
From MaRDI portal
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.05044MaRDI QIDQ4229266
Publication date: 9 May 1999
05C38: Paths and cycles
05C75: Structural characterization of families of graphs
05C12: Distance in graphs
Related Items
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