✦ LIBER ✦

A sufficient condition for graphs with large neighborhood unions to be traceable

✍ Scribed by Shijun Ren

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 246 KB
Volume: 161
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00230-t

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that a 2-connected graph G of order p is traceable if (u, v, w, x are distinct vertices of G). In addition, we give a short proof of Lindquester's conjecture.

📜 SIMILAR VOLUMES

A sufficient condition for graphs to be

A sufficient condition for graphs to be fractional -deleted graphs

✍ Sizhong Zhou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 218 KB

graph a b s t r a c t Let G be a graph, and k a positive integer. Let h : E(G) → [0, 1] be a function. If ∑ e∋x h(e) = k holds for each x ∈ V (G), then we call G[F h ] a fractional k-factor of G with indicator function h where F h = {e ∈ E(G) : h(e) > 0}. A graph G is called a fractional (k, m)delet

A sufficient condition for oriented grap

A sufficient condition for oriented graphs to be Hamiltonian

✍ Odile Favaron; Oscar Ordaz 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Sufficient conditions for a graph to be

Sufficient conditions for a graph to be Hamiltonian

✍ S Goodman; S Hedetniemi 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 330 KB

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 π(

A sufficient condition for a regular gra

A sufficient condition for a regular graph to be class 1

✍ A. J. W. Hilton; Cheng Zhao 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 553 KB

## Abstract The core __G__Δ of a simple graph __G__ is the subgraph induced by the vertices of maximum degree. It is well known that the Petersen graph is not 1‐factorizable and has property that the core of the graph obtained from it by removing one vertex has maximum degree 2. In this paper, we p