𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree

✍ Scribed by Klas Markström; Andrew Thomason; Peter Wagner

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
148 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Properly coloured Hamiltonian paths in e
Properly coloured Hamiltonian paths in edge-coloured complete graphs
✍ J. Bang-Jensen; G. Gutin; A. Yeo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 251 KB

We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the follou~ng conjecture by B. Bollobis and P. Erdijs (1976): if G is an edge-coloured complete graph on )I vertices in which the max

Edge-coloured complete graphs: Connected
Edge-coloured complete graphs: Connectedness of some subgraphs
✍ Adam Idzik; Jan Komar; Marcin Malawski 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 435 KB

If the edges of a complete graph K,., m/> 4, are painted two colours so that monochromatic K " graphs are connected, then there exists an increasing sequence ( n)n~4 of complete subgraphs whose monochromatic subgraphs are also connected. For more than two colours this is not true, but an analogous f

Light subgraphs in planar graphs of mini
Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9
✍ B. Mohar; R. Škrekovski; H.-J. Voss 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 326 KB 👁 1 views

## Abstract A graph __H__ is light in a given class of graphs if there is a constant __w__ such that every graph of the class which has a subgraph isomorphic to __H__ also has a subgraph isomorphic to __H__ whose sum of degrees in __G__ is ≤ __w__. Let $\cal G$ be the class of simple planar graphs