P3-isomorphisms for graphs
From MaRDI portal
Recommendations
- On the determination problem for \(P_3\)-transformation of graphs
- On the characterization of path graphs
- Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected \(P_{3}\)-graphs
- Path graphs
- Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\)
- Isomorphisms ofP3-graphs
- scientific article; zbMATH DE number 1842917
- Isomorphisms of directed \({\vec{P}}_3\)-graphs.
- scientific article; zbMATH DE number 1051283
- scientific article; zbMATH DE number 1933263
Cited in
(16)- On the determination problem for \(P_{4}\)-transformation of graphs
- Graph isomorphism is low for PP
- Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
- Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\)
- Edge-connectivity in \(P_k\)-path graphs
- Isomorphisms of circulant digraphs of degree 3
- Recognizing \(P_ 3\)-structure: A switching approach
- Recognizing \(k\)-path graphs
- A time-based solution for the graph isomorphism problem
- A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected
- Isomorphisms of directed \({\vec{P}}_3\)-graphs.
- 3-connected Planar Graph Isomorphism is in Log-space
- Histories in Path Graphs
- scientific article; zbMATH DE number 1051283 (Why is no real title available?)
- Diameter of path graphs
- Isomorphisms ofP3-graphs
This page was built for publication: P3-isomorphisms for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355070)
