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

zbMATH Open1243.05083MaRDI QIDQ426833FDOQ426833

Authors: Mikio Kano, S. Akbari, M. Ghanbari, M. J. Nikmehr 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• 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
• Some criteria for a graph to be class 1
• scientific article; zbMATH DE number 140153
• scientific article; zbMATH DE number 927053

zbMATH Keywords

edge coloringchromatic indexclass 1core of a graph

Mathematics Subject Classification ID

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

Cited In (13)

• The chromatic index of a graph whose core has maximum degree two
• On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges.
• Edge-colouring graphs with bounded local degree sums
• \(t\)-cores for \((\Delta + t )\)-edge-coloring
• Cores of class II graphs
• The chromatic index of a claw-free graph whose core has maximum degree 2
• Title not available (Why is that?)
• \(\delta\)-neighborhood chromatic index of a graph
• The chromatic index of a graph whose core is a cycle of order at most 13
• Decompositions for edge-coloring join graphs and cobipartite graphs
• Title not available (Why is that?)
• On the size of graphs of class 2 whose cores have maximum degree two
• Graph edge coloring: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426833)