On distance edge-colourings and matchings

DOI10.1016/J.ENDM.2009.07.049zbMath1273.05071OpenAlexW2174315020MaRDI QIDQ2851479

Ross J. Kang, Putra Manggala

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.049

zbMATH Keywords

random graphsgraph colouringinduced matchingstrong chromatic indexgraphs of bounded maximum degreedistance edge colouringmaximun induced matching number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Distance edge coloring and collision‐free communication in wireless sensor networks ⋮ Distance edge-colourings and matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Induced matchings in bipartite graphs
• 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
• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
• On the $b$ -Independence Number of Sparse Random Graphs
• The Strong Chromatic Index of Random Graphs

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