A new bound for parsimonious edge-colouring of graphs with maximum degree three.

Abstract : In a graph $G$ of maximum degree $3$, let $\gamma(G)$ denote the largest fraction of edges that can be $3$ edge-coloured. Rizzi \cite{Riz09} showed that $\gamma(G) \geq 1-\frac{2 \strut}{\strut 3 g_{odd}(G)}$ where $g_{odd}(G)$ is the odd girth of $G$, when $G$ is triangle-free. In \cite{FouVan10a} we extended that result to graph with maximum degree $3$. We show here that $\gamma(G) \geq 1-\frac{2 \strut}{\strut 3 g_{odd}(G)+2}$, which leads to $\gamma(G) \geq \frac{15}{17}$ when considering graphs with odd girth at least $5$, distinct from the Petersen graph.
Document type :
Other publications
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00516702
Contributor : Jean-Marie Vanherpe <>
Submitted on : Sunday, February 27, 2011 - 11:46:56 AM
Last modification on : Thursday, February 7, 2019 - 4:46:16 PM
Long-term archiving on : Saturday, May 28, 2011 - 2:24:24 AM

Files

Parcimonious_15_17_Version_27_...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00516702, version 2
  • ARXIV : 1102.5523

Collections

Citation

Jean-Luc Fouquet, Jean-Marie Vanherpe. A new bound for parsimonious edge-colouring of graphs with maximum degree three.. 2011. ⟨hal-00516702v2⟩

Share

Metrics

Record views

138

Files downloads

46