Recognizing \(k\)-path graphs

DOI10.1016/S0166-218X(99)00132-8zbMath0941.05042MaRDI QIDQ1962042

Erich Prisner

Publication date: 3 August 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

characterizationrecognition algorithmgraph recognition\(k\)-path graphpolarized graph

Mathematics Subject Classification ID

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

On the determination problem for \(P_{4}\)-transformation of graphs ⋮ Histories in Path Graphs

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