✦ LIBER ✦

Partitioning and coloring graphs with degree constraints

✍ Scribed by Rabern, Landon

Book ID: 120522459
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 400 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.01.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph partitions with minimum degree con

Graph partitions with minimum degree constraints

✍ Esther M. Arkin; Refael Hassin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Given a graph with n nodes and minimum degree 6, we give a polynomial time algorithm that constructs a partition of the nodes of the graph into two sets X and Y such that the sum of the minimum degrees in X and in Y is at least 6 and the cardinalities of X and Y differ by at most 6 (6 + 1 if n ~ 6 (

Randomly Coloring Constant Degree Graphs

✍ Martin Dyer; Alan Frieze; Thomas P. Hayes; Eric Vigoda 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

Edge-coloring critical graphs with high

Edge-coloring critical graphs with high degree

✍ Lian-ying Miao; Jian-liang Wu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 72 KB

Partitioning graph matching with constra

Partitioning graph matching with constraints

✍ Richard E. Blake 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Sum Coloring of Bipartite Graphs with Bo

Sum Coloring of Bipartite Graphs with Bounded Degree

✍ Michal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 580 KB

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