On the characterization of path graphs

DOI10.1002/jgt.3190170403zbMath0780.05048OpenAlexW2027064369MaRDI QIDQ3137761

Yanpei Liu, Huaien Li

Publication date: 13 October 1993

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170403

zbMATH Keywords

line graphspath graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (12)

Edge-connectivity in \(P_k\)-path graphs ⋮ A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected ⋮ Diameter of path graphs ⋮ Characterization of common-edge sigraph ⋮ New results and open problems in line graphs ⋮ Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs ⋮ A study of 3-arc graphs ⋮ Recognizing \(k\)-path graphs ⋮ Hadwiger's conjecture for 3-arc graphs ⋮ On the determination problem for \(P_{4}\)-transformation of graphs ⋮ Histories in Path Graphs ⋮ Three-arc graphs: characterization and domination

This page was built for publication: On the characterization of path graphs