On the size of graphs of class 2 whose cores have maximum degree two
type: Item
instance of: scholarly article
title: On the size of graphs of class 2 whose cores have maximum degree two
zbMATH Open document ID: 1272.05051
author: Z. X. Song
author: K. M. Koh
published in: Graphs and Combinatorics
publication date: 2013-09-26T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6211647
zbMATH Keywords: edge coloring
zbMATH Keywords: chromatic index
zbMATH Keywords: overfull
MaRDI profile type: Publication
full work available at URL: s00373-012-1184-9
OpenAlex ID: W2018191751
cites work: On small graphs critical with respect to edge colourings
cites work: Regular Graphs of High Degree are 1-Factorizable
cites work: The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
cites work: Chromatic index critical graphs of order 9
cites work: Q5181716
cites work: The chromatic index of a graph whose core has maximum degree two
cites work: A sufficient condition for a regular graph to be class 1
cites work: Q4892326
cites work: Q3147264
cites work: Chromatic index critical graphs of even order with five major vertices
cites work: The Factorization of Linear Graphs
cites work: Q5558480
cites work: Alternative proofs of three theorems of Chetwynd and Hilton
cites work: Q3715121
DOI: 10.1007/S00373-012-1184-9
description: scientific article; zbMATH DE number 6211647