𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of sparse graphs with prescribed circular colorings

✍ Scribed by Jaroslav Nešetřil; Xuding Zhu

Book ID
108315542
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
158 KB
Volume
233
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Injective colorings of sparse graphs
Injective colorings of sparse graphs
✍ Daniel W. Cranston; Seog-Jin Kim; Gexin Yu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 338 KB
Acyclic edge-colorings of sparse graphs
Acyclic edge-colorings of sparse graphs
✍ Y. Caro; Y. Roditty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 393 KB

A k-forest is a forest in which the maximum degree is k. The k-arboricity denoted Ak(G) is the minimum number of k-forests whose union is the graph G. We show that if G is an m-degenerate graph of maximum degree A, then Ak(G) 5 [(A + (k -1) m -1)/k], k 2 2, and derive several consequences of this in

Circular colorings of weighted graphs
Circular colorings of weighted graphs
✍ Deuber, Walter A.; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 776 KB

Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t . A t-circular coloring of (G,w) is a mapping A of the vertices of G to arcs of C such that A(%) n A(y) = 0 if (x, y) E E ( G ) and A(x) has l

Coloring Graphs with Sparse Neighborhood
Coloring Graphs with Sparse Neighborhoods
✍ Noga Alon; Michael Krivelevich; Benny Sudakov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

It is shown that the chromatic number of any graph with maximum degree d in which the number of edges in the induced subgraph on the set of all neighbors of any vertex does not exceed d 2 Âf is at most O(dÂlog f ). This is tight (up to a constant factor) for all admissible values of d and f.

Circular colorings of edge-weighted grap
Circular colorings of edge-weighted graphs
✍ Bojan Mohar 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

## Abstract The notion of (circular) colorings of edge‐weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs