Premium
Trees and unicyclic graphs with hamiltonian path graphs
Author(s) -
Yu Xingxing
Publication year - 1990
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190140610
Subject(s) - mathematics , combinatorics , indifference graph , chordal graph , hamiltonian path , longest path problem , pathwidth , discrete mathematics , path (computing) , graph , line graph , computer science , programming language
We prove two conjectures of Broersma and Hoede about path graphs of trees and unicyclic graphs.