Beyond the Vizing's Bound for at Most Seven Colors

DOI10.1137/120899765zbMath1305.05079arXiv1211.5031OpenAlexW2964001688MaRDI QIDQ2935272

Łukasz Kowalik, Marcin Kaminski

Publication date: 22 December 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.5031

zbMATH Keywords

approximation algorithmedge coloringlower bounds

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

Between proper and strong edge‐colorings of subcubic graphs ⋮ Online edge coloring of paths and trees with a fixed number of colors ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Diverse Pairs of Matchings ⋮ Parsimonious edge-coloring on surfaces

This page was built for publication: Beyond the Vizing's Bound for at Most Seven Colors