P3-isomorphisms for graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199709)26:1<35::AID-JGT5>3.0.CO;2-I" /><35::AID-JGT5>3.0.CO;2-I 10.1002/(SICI)1097-0118(199709)26:1<35::AID-JGT5>3.0.CO;2-IzbMath0884.05065OpenAlexW1988639832MaRDI QIDQ4355070

Peter Jipsen, R. E. L. Aldred, R. L. Hemminger, Mark N. Ellingham

Publication date: 8 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199709)26:1<35::aid-jgt5>3.0.co;2-i

zbMATH Keywords

line graphisomorphismpath graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

Edge-connectivity in \(P_k\)-path graphs ⋮ A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected ⋮ Diameter of path graphs ⋮ A time-based solution for the graph isomorphism problem ⋮ Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs ⋮ Recognizing \(k\)-path graphs ⋮ Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\) ⋮ On the determination problem for \(P_{4}\)-transformation of graphs ⋮ Histories in Path Graphs

This page was built for publication: P3-isomorphisms for graphs