Recognizing \(k\)-path graphs
From MaRDI portal
Publication:1962042
DOI10.1016/S0166-218X(99)00132-8zbMath0941.05042MaRDI QIDQ1962042
Publication date: 3 August 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- On the characterization of path graphs
- Path graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- P3-isomorphisms for graphs
- Isomorphisms ofP3-graphs
- Bicliques in graphs. I: Bounds on their number