✦ LIBER ✦

Minimum degree games for graphs

✍ Scribed by Daniel M. Gordon; Robert W. Robinson; Frank Harary

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 792 KB
Volume: 128
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90109-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum degree thresholds for bipartite

Minimum degree thresholds for bipartite graph tiling

✍ Albert Bush; Yi Zhao 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

## Abstract Given a bipartite graph __H__ and a positive integer __n__ such that __v__(__H__) divides 2__n__, we define the minimum degree threshold for bipartite __H__‐tiling, δ~2~(__n, H__), as the smallest integer __k__ such that every bipartite graph __G__ with __n__ vertices in each partition

Overfull conjecture for graphs with high

Overfull conjecture for graphs with high minimum degree

✍ Michael Plantholt 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB

## Abstract Chetwynd and Hilton showed that any regular graph __G__ of even order __n__ which has relatively high degree $\Delta (G)\,\ge\,((\sqrt{7}- 1)/2)\, n$ has a 1‐factorization. This is equivalent to saying that under these conditions __G__ has chromatic index equal to its maximum degree $\D

Balanced graphs with minimum degree cons

Balanced graphs with minimum degree constraints

✍ John Sheehan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Sheehan, J., Balanced graphs with minimum degree constraints, Discrete Mathematics 102 (1992) 307-314. Let G be a finite simple graph on n vertices with minimum degree 6 = 6(G) (n = 6 (mod 2)). Suppose that 0 < 6 c n -2, 06 i 4 [?Sl. A partition (x, Y) of V(G) is said to be an (i, a)-partition of G

Algorithms for Degree Constrained Graph

Algorithms for Degree Constrained Graph Factors of Minimum Deficiency

✍ P. Hell; D.G. Kirkpatrick 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1008 KB

The minimum degree of Ramsey-minimal gra

The minimum degree of Ramsey-minimal graphs

✍ Jacob Fox; Kathy Lin 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract We write __H__ → __G__ if every 2‐coloring of the edges of graph __H__ contains a monochromatic copy of graph __G__. A graph __H__ is __G__‐__minimal__ if __H__ → __G__, but for every proper subgraph __H__′ of __H__, __H__′ ↛ __G__. We define __s__(__G__) to be the minimum __s__ such th

On minimum degree in Hamiltonian path gr

On minimum degree in Hamiltonian path graphs

✍ George R. T. Hendry 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views