Can I read Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle on EtoBox?
Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle by Haruhide Matsuda is a Computer Science article available to read on EtoBox.
What is Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle about?
Let 1 6 a ¡ b be integers and G a Hamiltonian graph of order |G| ¿ (a + b)(2a + b)=b. Suppose that (G) ¿ a + 2 and max{deg G (x); deg G (y)} ¿ a|G|=(a + b) + 2 for each pair of nonadjacent vertices x and y in G. Then G has an [a; b]-factor which is edge-disjoint from a given Hamiltonian cycle. The lower bound on the degree condition is sharp. For the case of odd a = b, there exists a graph satisfying the conditions of the theorem but having no desired factor. As consequences, we have the degree conditions for Hamiltonian graphs to have [a; b]-factors containing a given Hamiltonian cycle.
Who reads Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Haruhide Matsuda
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 2004
- Language
- EN
- Field
- Computer Science (Physical Sciences)