-numbers of several classes of snarks

DOI10.1007/S10878-012-9589-1zbMATH Open1309.05157OpenAlexW2011409463MaRDI QIDQ489727FDOQ489727

Authors: Dengju Ma, Hengfeng Zhu, Jianbao He 

Publication date: 21 January 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9589-1

Recommendations

• \(L(2,1)\)-labeling of flower snark and related graphs.
• The \(L (3,2,1)\)-labeling of Goldberg snark graphs
• Petersen-colorings and some families of snarks
• On coloring problems of snark families
• Snark designs

zbMATH Keywords

snark\(\lambda\)-numberL(2, 1)-labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Graph theory
• Labelling Graphs with a Condition at Distance 2
• A survey on labeling graphs with a condition at distance two
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Title not available (Why is that?)
• Construction of class two graphs with maximum vertex degree three
• On generalized Petersen graphs labeled with a condition at distance two
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: \(\lambda\)-numbers of several classes of snarks

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