✦ LIBER ✦

A sufficient condition for a graph to contain three disjoint 1-factors

✍ Scribed by Sein Win

Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 219 KB
Volume: 6
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190060413

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Ore derived a sufficient condition for a graph to contain a Hamiltonian cycle. We obtain a sufficient condition, similar to Ore's condition, for a graph to contain a Hamiltonian cycle and a 1‐factor which are edge disjoint.

📜 SIMILAR VOLUMES

A sufficient condition for a bipartite g

A sufficient condition for a bipartite graph to have a k-factor

✍ Hikoe Enomoto; Katsuhiro Ota; Mikio Kano 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 1 views

Two sufficient conditions for a 2-factor

Two sufficient conditions for a 2-factor in a bipartite graph

✍ P. Katerinis 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

A degree condition for a graph to have [

A degree condition for a graph to have [a,b]-factors

✍ Li, Yanjun; Mao-cheng, Cai 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 2 views

Let G be a graph of order n, and let a and b be integers such that a+b for any two nonadjacent vertices u and v in G. This result is best possible, and it is an extension of T. Iida and T. Nishimura's results (T. Iida and T. Nishimura, An Ore-type condition for the existence of k-factors in graphs,

A sufficient condition for bipartite gra

A sufficient condition for bipartite graphs to be type one

✍ Xu, Baogang 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The total chromatic number χ T (G) of graph G is the least number of colors assigned to V (G) ∪ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have χ T (G) = ∆(G) + 1.

A sufficient condition for planar graphs

A sufficient condition for planar graphs to be acyclically 5-choosable

✍ Min Chen; André Raspaud 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB 👁 1 views

## Abstract A proper vertex coloring of a graph __G__ = (__V, E__) is acyclic if __G__ contains no bicolored cycle. Given a list assignment __L__ = {__L__(__v__)|__v__∈__V__} of __G__, we say __G__ is acyclically __L__‐list colorable if there exists a proper acyclic coloring π of __G__ such that π(

Sufficient conditions for a graph to be

Sufficient conditions for a graph to be super restricted edge-connected

✍ Shiying Wang; Shangwei Lin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB

## Abstract Restricted edge connectivity is a more refined network reliability index than edge connectivity. A restricted edge cut __F__ of a connected graph __G__ is an edge cut such that __G__‐__F__ has no isolated vertex. The restricted edge connectivity λ′ is the minimum cardinality over all re