✦ LIBER ✦

Disconnected Colors in Generalized Gallai-Colorings

✍ Scribed by Shinya Fujita; András Gyárfás; Colton Magnant; Ákos Seress

Book ID: 115558805
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 524 KB
Volume: 74
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21694

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gallai colorings and domination in multi

Gallai colorings and domination in multipartite digraphs

✍ András Gyárfás; Gábor Simonyi; Ágnes Tóth 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB

Ramsey-type results for Gallai colorings

✍ András Gyárfás; Gábor N. Sárközy; András Sebő; Stanley Selkow 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

## Abstract A Gallai‐coloring of a complete graph is an edge coloring such that no triangle is colored with three distinct colors. Gallai‐colorings occur in various contexts such as the theory of partially ordered sets (in Gallai's original paper) or information theory. Gallai‐colorings extend 2‐co

Gallai's Theorem for List Coloring of Di

Gallai's Theorem for List Coloring of Digraphs

✍ Harutyunyan, Ararat; Mohar, Bojan 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 264 KB

On a generalization of the Gallai–Roy–Vi

On a generalization of the Gallai–Roy–Vitaver theorem to the bandwidth coloring problem

✍ Bernard Gendron; Alain Hertz; Patrick St-Louis 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Color in computer-generated displays

✍ Helen Roxlo Delp 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB

On generalized graph colorings

✍ Jason I. Brown; Derek G. Corneil 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

Given a property P, graph G. and k 2 0, a P k-coloring is a function 7r: V(G) + { I , ... , k) such that the subgraph induced by each color class has property P; x ( G : P ) is the least k, for which G has a P k-coloring. We investigate here the theory of P colorings. Generalizations of the wellknow