✦ LIBER ✦

Path factors in cubic graphs

✍ Scribed by Ken-ichi Kawarabayashi; Haruhide Matsuda; Yoshiaki Oda; Katsuhiro Ota

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 67 KB
Volume: 39
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path factors of bipartite graphs

✍ Hong Wang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 375 KB

## Abstract A path on __n__ vertices is denoted by __P__~__n__~. For any graph __H__, the number of isolated vertices of __H__ is denoted by __i(H)__. Let __G__ be a graph. A spanning subgraph __F__ of __G__ is called a {__P__~3~, __P__~4~, __P__~5~}‐factor of __G__ if every component of __F__ is o

Minimum path decompositions of oriented

Minimum path decompositions of oriented cubic graphs

✍ K. B. Reid; Keith Wayland 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 1 views

Pullman [3] conjectured that if k is an odd positive integer, then every orientation of a regular graph of degree k has a minimum decomposition which contains no vertex which is both the initial vertex of some path in the decomposition and the terminal vertex of some other path in the decomposition

Disconnected 2-Factors in Planar Cubic B

Disconnected 2-Factors in Planar Cubic Bridgeless Graphs

✍ Ajit A. Diwan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Cubic graphs with 62 vertices having the

Cubic graphs with 62 vertices having the same path layer matrix

✍ A. A. Dobrynin 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract The path layer matrix (or path degree sequence) of a graph __G__ contains quantitative information about all paths in __G__. The entry (__i,j__) in this matrix is the number of simple paths in __G__ having initial vertex __v__ and length __j.__ It was known that there are cubic graphs o

Cubic graphs without cut-vertices having

Cubic graphs without cut-vertices having the same path layer matrix

✍ Andrey A. Dobrynin 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract The path layer matrix (or path degree sequence) of a graph __G__ contains quantitative information about all possible paths in __G__. The entry (__i,j__) of this matrix is the number of paths in __G__ having initial vertex __i__ and length __j__. It is known that there are cubic graphs

How many disjoint 2-edge paths must a cu

How many disjoint 2-edge paths must a cubic graph have?

✍ Alexander Kelmans; Dhruv Mubayi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

## Abstract In this paper we show that every simple cubic graph on __n__ vertices has a set of at least ⌈ __n__/4 ⌉ disjoint 2‐edge paths and that this bound is sharp. Our proof provides a polynomial time algorithm for finding such a set in a simple cubic graph. © 2003 Wiley Periodicals, Inc. J Gra