The chromatic index of a graph whose core has maximum degree 2

zbMath1243.05083MaRDI QIDQ426833

Mohammad Javad Nikmehr, Saieed Akbari, Maryam Ghanbari, Mikio Kano

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p58

zbMATH Keywords

edge coloringchromatic indexclass 1core of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (4)

Edge-colouring graphs with bounded local degree sums ⋮ Graph edge coloring: a survey ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2

This page was built for publication: The chromatic index of a graph whose core has maximum degree 2