On the chromatic index of join graphs and triangle-free graphs with large maximum degree
type: Item
instance of: scholarly article
title: On the chromatic index of join graphs and triangle-free graphs with large maximum degree
zbMATH Open document ID: 1387.05101
author: A. Zorzi
author: Leandro M. Zatesko
published in: Discrete Applied Mathematics
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6872421
zbMATH Keywords: edge-colouring
zbMATH Keywords: join graphs
zbMATH Keywords: overfull conjecture
MaRDI profile type: Publication
full work available at URL: j.dam.2016.10.022
OpenAlex ID: W2553106345
cites work: NP-completeness of edge-colouring some restricted graphs
cites work: The chromatic index of graphs of even order with many edges
cites work: Four classes of perfectly orderable graphs
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q5604409
cites work: Méthode et théorème général de coloration des aretes d'un multigraphe
cites work: Graphs which are vertex-critical with respect to the edge-chromatic number
cites work: The chromatic index of complete multipartite graphs
cites work: The NP-Completeness of Edge-Coloring
cites work: Linear time algorithms for graph search and connectivity determination on complement graphs.
cites work: Quasi-threshold graphs
cites work: The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
cites work: On the chromatic index of cographs and join graphs
cites work: Decompositions for edge-coloring join graphs and cobipartite graphs
cites work: Chromatic index of graphs with no cycle with a unique chord
cites work: How to find overfull subgraphs in graphs with large maximum degree
cites work: How to find overfull subgraphs in graphs with large maximum degree. II
cites work: The chromatic index of graphs with a spanning star
cites work: Edge-colouring of join graphs
cites work: Edge-colouring of joins of regular graphs. II
DOI: 10.1016/J.DAM.2016.10.022
Recommended article: On the chromatic index of cographs and join graphs
Recommended article: The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
Recommended article: On the chromatic number of triangle-free graphs of large minimum degree
Recommended article: On the chromatic index of multigraphs without large triangles
Recommended article: The chromatic index of graphs of high maximum degree
Recommended article: The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
Recommended article: Q4735206
Recommended article: Triangle-free graphs with large chromatic numbers
Recommended article: The total chromatic number of graphs having large maximum degree
Recommended article: On the chromatic index of almost all graphs
description: scientific article; zbMATH DE number 6872421