Recognizing k-path graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1107738 (Why is no real title available?)
- scientific article; zbMATH DE number 851097 (Why is no real title available?)
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Bicliques in graphs. I: Bounds on their number
- Isomorphisms ofP3-graphs
- On the characterization of path graphs
- P3-isomorphisms for graphs
- Path graphs
Cited in
(12)- scientific article; zbMATH DE number 475419 (Why is no real title available?)
- Histories in path graphs
- On the determination problem for \(P_{4}\)-transformation of graphs
- scientific article; zbMATH DE number 2170450 (Why is no real title available?)
- Recognizing Bellman–Ford-Orderable Graphs
- Recognizing clique graphs of directed and rooted path graphs
- Path-bicolorable graphs
- On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths
- Histories in Path Graphs
- Two new characterizations of path graphs
- Path-bicolorable graphs. (Extended abstract)
- From path graphs to directed path graphs
This page was built for publication: Recognizing \(k\)-path graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962042)
