✦ LIBER ✦

Trees and unicyclic graphs with hamiltonian path graphs

✍ Scribed by Xingxing Yu

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 154 KB
Volume: 14
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190140610

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We prove two conjectures of Broersma and Hoede about path graphs of trees and unicyclic graphs.

📜 SIMILAR VOLUMES

Hamiltonian path graphs

✍ Gary Chartrand; S. F. Kapoor; E. A. Nordhaus 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 389 KB

## Abstract The Hamiltonian path graph __H(G)__ of a graph __G__ is that graph having the same vertex set as __G__ and in which two vertices __u__ and __v__ are adjacent if and only if __G__ contains a Hamiltonian __u‐v__ path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonia

Line graphs of bipartite graphs with Ham

Line graphs of bipartite graphs with Hamiltonian paths

✍ Francis K. Bell 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

It is shown that, if t is an integer !3 and not equal to 7 or 8, then there is a unique maximal graph having the path P t as a star complement for the eigenvalue À2: The maximal graph is the line graph of K m,m if t ¼ 2mÀ1, and of K m,m þ1 if t ¼ 2m. This result yields a characterization of L(G ) wh

On the hamiltonian path graph of a graph

✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

On minimum degree in Hamiltonian path gr

On minimum degree in Hamiltonian path graphs

✍ George R. T. Hendry 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

Powers of Hamiltonian paths in interval

Powers of Hamiltonian paths in interval graphs

✍ Isaak, Garth 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB 👁 3 views

We give a simple proof that the obvious necessary conditions for a graph to contain the k th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We wi

Backbone colorings for graphs: Tree and

Backbone colorings for graphs: Tree and path backbones

✍ Hajo Broersma; Fedor V. Fomin; Petr A. Golovach; Gerhard J. Woeginger 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph __G__ = (__V__,__E__) and a spanning subgraph __H__ of __G__ (the backbone of __G__), a backbone coloring for __G__ and __H__ is a proper vertex coloring __V__ → {1,2,…} of __G__ in which