The edge-labeling and vertex-colors of K_n

DOI10.1186/2251-7456-6-45zbMATH Open1268.05059OpenAlexW2042778143WikidataQ59273084 ScholiaQ59273084MaRDI QIDQ2391759FDOQ2391759

Authors: Hadi Mohammad Alaeiyan 

Publication date: 5 August 2013

Published in: Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/2251-7456-6-45

Recommendations

• On the vertex-distinguishing edge coloring of \(S_n \vee K_{n,n}\)
• scientific article; zbMATH DE number 3977043
• scientific article; zbMATH DE number 2157279
• Edge coloring total \(k\)-labeling of generalized Petersen graphs
• Edge \(k\)-\(q\)-colorability of graphs
• On total and edge coloring some Kneser graphs
• Edge coloring by total labelings of outerplanar graphs
• Coloring the edges ofkm ×km
• scientific article; zbMATH DE number 1555935
• Edge-Coloring and f-Coloring for Various Classes of Graphs

zbMATH Keywords

complete graphvertex-coloringedge-labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• On vertex-coloring 13-edge-weighting
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• How to Increase Robustness of Capable-to-Promise

Cited In (1)

• The 1-2-3 edge labeling and vertex coloring of complete graph \(K_N\) with a modified algorithm

This page was built for publication: The edge-labeling and vertex-colors of \(K_n\)

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