Distance edge-colourings and matchings

DOI10.1016/j.dam.2012.07.001zbMath1329.05111OpenAlexW2089589410MaRDI QIDQ714033

Putra Manggala, Ross J. Kang

Publication date: 19 October 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.07.001

zbMATH Keywords

random graphsgraph colouringstrong chromatic indexinduced matchingsdistance edge-colouring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (3)

Maximizing Line Subgraphs of Diameter at Most t ⋮ The Distance-t Chromatic Index of Graphs ⋮ $t$-Strong Cliques and the Degree-Diameter Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced matchings in bipartite graphs
• NP-completeness of some generalizations of the maximum matching problem
• A bound on the strong chromatic index of a graph
• Bounding the strong chromatic index of dense random graphs
• Algorithms for finding distance-edge-colorings of graphs
• On distance edge-colourings and matchings
• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
• On the $b$ -Independence Number of Sparse Random Graphs
• Some maximum multigraphs and adge/vertex distance colourings
• The Strong Chromatic Index of Random Graphs

This page was built for publication: Distance edge-colourings and matchings