✦ LIBER ✦

List coloring of graphs having cycles of length divisible by a given number

✍ Scribed by S. Akbari; M. Ghanbari; S. Jahanbekam; M. Jamaali

Book ID: 108114078
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 237 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.08.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nonseparable graphs with a given number

Nonseparable graphs with a given number of cycles

✍ Ranko Šćepanović; Gerhard Ringel; Dragan Marušič; G. L. Chia; Brian Alspach 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

## Abstract G. Ringel conjectured that for every positive integer __n__ other than 2, 4, 5, 8, 9, and 16, there exists a nonseparable graph with __n__ cycles. It is proved here that the conjecture is true even with the restriction to planar and hamiltonian graphs.

Graphs with a Cycle of Length Divisible

Graphs with a Cycle of Length Divisible by Three

✍ G.T. Chen; A. Saito 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 468 KB

In this paper, we will prove that every graph \(G\) with minimum degree \(\delta(G) \geqslant 3\) contains a cycle of length divisible by three. This was conjectured to be true by Barefoot, Clark, Douthett, and Entringer. 11994 Academic Press, Inc.

The number of cycle lengths in graphs of

The number of cycle lengths in graphs of given minimum degree and girth

✍ P. Erdős; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 333 KB

This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ck ~.

Graphs with large maximum degree contain

Graphs with large maximum degree containing no odd cycles of a given length

✍ Paul Balister; Béla Bollobás; Oliver Riordan; Richard H. Schelp 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

The number of labeled graphs placeable b

The number of labeled graphs placeable by a given permutation

✍ Hasunuma, Toru; Shibata, Yukio 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB 👁 2 views

Let S be a finite set and u a permutation on S. The permutation u\* on the set of 2-subsets of S is naturally induced by u. Suppose G is a graph and V(G), €(G) are the vertex set, the edge set, respectively. Let V(G) = S. If €(G) and u\*(€(G)), the image of €(G) by u\*, have no common element, then

On the number of cycles of length 4 in a

On the number of cycles of length 4 in a maximal planar graph

✍ Ahmad Fawzi Alameddine 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB 👁 2 views

## Abstract Let __p__ and __C__~4~ (__G__) be the number of vertices and the number of 4‐cycles of a maximal planar graph __G__, respectively. Hakimi and Schmeichel characterized those graphs __G__ for which __C__~4~ (__G__) = 1/2(__p__^2^ + 3__p__ ‐ 22). This characterization is correct if __p__ ≥