Distance edge-colourings and matchings (Q714033)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Distance edge-colourings and matchings	scientific article

Statements

scholarly article

Distance edge-colourings and matchings (English)

Discrete Applied Mathematics

publication date

19 October 2012

zbMATH Keywords

graph colouring

strong chromatic index

induced matchings

distance edge-colouring

random graphs

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.dam.2012.07.001

On the $b$ -Independence Number of Sparse Random Graphs

Bounding the strong chromatic index of dense random graphs

Induced matchings in bipartite graphs

The Strong Chromatic Index of Random Graphs

Algorithms for finding distance-edge-colorings of graphs

On distance edge-colourings and matchings

A bound on the strong chromatic index of a graph

Some maximum multigraphs and adge/vertex distance colourings

NP-completeness of some generalizations of the maximum matching problem

A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.DAM.2012.07.001

Sitelinks

Mathematics(1 entry)

mardi Publication:714033

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q714033&oldid=38460554"