Strong edge chromatic index of the generalized Petersen graphs

DOI10.1016/j.amc.2017.10.047zbMath1426.05052OpenAlexW2769124529MaRDI QIDQ2423067

Baoyindureng Wu, Zi-Xuan Yang

Publication date: 21 June 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.10.047

zbMATH Keywords

generalized Petersen graphsstrong chromatic indexstrong edge coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ Injective edge coloring of generalized Petersen graphs ⋮ The strong chromatic index of graphs with edge weight eight ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Injective edge chromatic index of generalized Petersen graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the total coloring of generalized Petersen graphs
• Embedding generalized Petersen graph in books
• The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
• Perfect 2-colorings of the generalized Petersen graph
• The strong chromatic index of Halin graphs
• On the strong chromatic index of cubic Halin graphs
• The decycling number of generalized Petersen graphs
• On induced matchings
• The strong chromatic index of a class of graphs
• The strong chromatic index of complete cubic Halin graphs
• The strong chromatic index of a cubic graph is at most 10
• Induced matchings
• On the computational complexity of strong edge coloring
• A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
• New results on induced matchings
• \(\alpha\)-labelings of a class of generalized Petersen graphs
• A tight upper bound for 2-rainbow domination in generalized Petersen graphs
• The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)
• ON THE SIGNED TOTAL DOMINATION NUMBER OF GENERALIZED PETERSEN GRAPHS P(n, 2)
• Induced matchings in cubic graphs
• Precise upper bound for the strong edge chromatic number of sparse planar graphs
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Self-dual configurations and regular graphs
• Acyclic 3-coloring of generalized Petersen graphs

This page was built for publication: Strong edge chromatic index of the generalized Petersen graphs