On labeling 2-regular graphs where the number of odd components is at most 2

zbMATH Open1293.05332MaRDI QIDQ2860826

M. Hirsch, S. I. El-Zanati, R. C. Bunge, D. Klope, B. Shafer, J. A. Mudrock, K. Sebesta

Publication date: 11 November 2013

Published in: Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

\(\rho\)-labelingvertex-disjoint union of a graph

Mathematics Subject Classification ID

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

This page was built for publication: On labeling 2-regular graphs where the number of odd components is at most 2

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