𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds and complexity results for strong edge colouring of subcubic graphs

✍ Scribed by Hervé Hocquard; Pascal Ochem; Petru Valicov

Book ID
119236596
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
388 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On strong edge-colouring of subcubic gra
On strong edge-colouring of subcubic graphs
✍ Hocquard, Hervé; Montassier, Mickaël; Raspaud, André; Valicov, Petru 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 593 KB
A probabilistic upper bound for the edge
A probabilistic upper bound for the edge identification complexity of graphs
✍ Eberhard Triesch 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Given a finite graph G=( V, E), what is the minimum number c(G) of incidence tests which are needed in the worst case to identify an unknown edge e\*EE? The number c(G) was first studied by Aigner and Triesch (1988), where it was shown that for almost all graphs in the random graph model where d(n)

New lower bounds for the size of edge ch
New lower bounds for the size of edge chromatic critical graphs
✍ Yue Zhao 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

## Abstract In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Δ. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004