𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Kőnig’s edge-colouring theorem for all graphs

✍ Scribed by Cornaz, D.; Nguyen, V.H.

Book ID
122397990
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
366 KB
Volume
41
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decompositions for the edge colouring of
Decompositions for the edge colouring of reduced indifference graphs
✍ Celina M.H. de Figueiredo; João Meidanis; Célia Picinin de Mello; Carmen Ortiz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 140 KB

The chromatic index problem-ÿnding the minimum number of colours required for colouring the edges of a graph-is still unsolved for indi erence graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal clique are consecutive in this order. We present new positi

Fixed-edge theorem for graphs with loops
Fixed-edge theorem for graphs with loops
✍ Richard Nowakowski; Ivan Rival 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 521 KB

## Abstract Let __G__ be an undirected graph without multiple edges and with a loop at every vertex—the set of edges of __G__ corresponds to a reflexive and symmetric binary relation on its set of vertices. Then __every edge‐preserving map of the set of vertices of G to itself fixes an edge__ [{__f