Characterizing and edge-colouring split-indifference graphs
type: Item
instance of: scholarly article
title: Characterizing and edge-colouring split-indifference graphs
zbMATH Open document ID: 0901.05043
DOI: 10.1016/S0166-218X(97)00128-5
author: Carmen Z. Ortiz
author: Jayme L. Szwarcfiter
author: Nelson Maculan
published in: Discrete Applied Mathematics
publication date: 1998-06-02T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 1139440
zbMATH Keywords: algorithms
zbMATH Keywords: split graphs
zbMATH Keywords: characterization
zbMATH Keywords: edge colouring
zbMATH Keywords: perfect matching
zbMATH Keywords: chromatic index
zbMATH Keywords: indifference graphs
MaRDI profile type: Publication
cites work: The Colour Numbers of Complete Graphs
cites work: Q3941433
cites work: On the edge-chromatic number of a graph
cites work: NP-completeness of edge-colouring some restricted graphs
cites work: On edge-colouring indifference graphs
cites work: Q3853641
cites work: Q4193514
cites work: Graphs which are vertex-critical with respect to the edge-chromatic number
cites work: The NP-Completeness of Edge-Coloring
cites work: On the compatibility between a graph and a simple order
cites work: Multicoloring the incidentors of a weighted directed multigraph
OpenAlex ID: W1993232133
description: scientific article; zbMATH DE number 1139440