Distance edge-colourings and matchings

DOI10.1016/J.DAM.2012.07.001zbMATH Open1329.05111OpenAlexW2089589410MaRDI QIDQ714033FDOQ714033

Authors: Ross J. Kang, Putra Manggala 

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

Recommendations

• On distance edge-colourings and matchings
• Distance edge coloring by total labelings of graphs
• Edge colorings and total colorings of integer distance graphs
• Colorings of distance graphs
• Colouring of distance graphs
• The distance coloring of graphs
• Coloring of \(n\)-dimensional distance graphs
• Distant set distinguishing edge colourings of graphs
• Coloring the distance graphs

zbMATH Keywords

random graphsstrong chromatic indexgraph colouringinduced matchingsdistance edge-colouring

Mathematics Subject Classification ID

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

Cites Work

• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• A bound on the strong chromatic index of a graph
• Induced matchings in bipartite graphs
• NP-completeness of some generalizations of the maximum matching problem
• Title not available (Why is that?)
• Algorithms for finding distance-edge-colorings of graphs
• On the $b$ -Independence Number of Sparse Random Graphs
• Some maximum multigraphs and adge/vertex distance colourings
• Bounding the strong chromatic index of dense random graphs
• On distance edge-colourings and matchings
• Title not available (Why is that?)
• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
• The Strong Chromatic Index of Random Graphs

Cited In (9)

• Edge colorings and total colorings of integer distance graphs
• Maximizing line subgraphs of diameter at most \(t\)
• \(t\)-strong cliques and the degree-diameter problem
• Distant set distinguishing edge colourings of graphs
• \(t\)-strong cliques and the degree-diameter problem
• Multicolor and directed edit distance
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• The distance-\(t\) chromatic index of graphs
• Distance-2-matchings of random graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714033)