𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Powers of cycles, powers of paths, and distance graphs

✍ Scribed by Min Chih Lin; Dieter Rautenbach; Francisco Juan Soulignac; Jayme Luiz Szwarcfiter

Book ID
108112872
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
245 KB
Volume
159
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Simplicial powers of graphs
Simplicial powers of graphs
✍ Andreas BrandstΓ€dt; Van Bang Le πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 898 KB
Distinguishing Cartesian powers of graph
Distinguishing Cartesian powers of graphs
✍ Wilfried Imrich; Sandi KlavΕΎar πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 132 KB

The distinguishing number D(G) of a graph is the least integer d such that there is a d-labeling of the vertices of G that is not preserved by any nontrivial automorphism of G. We show that the distinguishing number of the square and higher powers of a connected graph G = K 2 , K 3 with respect to t

Coloring Powers of Chordal Graphs
Coloring Powers of Chordal Graphs
✍ KrΓ‘l', Daniel πŸ“‚ Article πŸ“… 2004 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 170 KB