On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs

DOI10.1016/J.ENDM.2017.06.003zbMath1377.05165OpenAlexW2728146060MaRDI QIDQ1687833

Peng Zhang

Publication date: 4 January 2018

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

zbMATH Keywords

graph labelings\(\lambda\)-fold labelingscyclic graph decompositionsordered labelings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

On minimum index Stanton 4-cycle designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions into linear forests and difference labelings of graphs
• A dynamic survey of graph labeling
• A survey on the existence ofG-Designs
• On Rosa-type labelings and cyclic graph decompositions

This page was built for publication: On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs