𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A gallai-type problem

✍ Scribed by V.J Baston; F.A Bostock

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
180 KB
Volume
24
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey-type results for Gallai colorings
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 problem on Dirac's construction
Gallai's problem on Dirac's construction
✍ D.A. Youngs 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 447 KB

It is thought that T. Gallai posed the following problem concerning a construction due to G.A. Dirac: suppose that a graph K consists of disjoint subgraphs G and Hand a set of edges joining them. If each of G, H, and K are colour critical graphs, under what circumstances is it then true that the joi

A Gallai–Edmonds-type structure theorem
A Gallai–Edmonds-type structure theorem for path-matchings
✍ Bianca Spille; László Szegő 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract As a generalization of matchings, Cunningham and Geelen introduced the notion of path‐matchings. We give a structure theorem for path‐matchings which generalizes the fundamental Gallai–Edmonds structure theorem for matchings. Our proof is purely combinatorial. © 2004 Wiley Periodicals,