Infinitely many trees with maximum number of holes zero, one, and two

DOI10.1155/2018/8186345zbMath1437.05075OpenAlexW2892380699MaRDI QIDQ1741707

Balakrishna Gudla, Srinivasa Rao Kola, P. K. Niranjan

Publication date: 7 May 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/8186345

Mathematics Subject Classification ID

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

Cites Work

• Solutions of some \(L(2, 1)\)-coloring related open problems
• A note on \(L (2, 1)\)-labelling of trees
• Holes in \(L(2,1)\)-coloring on certain classes of graphs
• A complete \(L (2, 1)\) span characterization for small trees
• No-hole \(L(2,1)\)-colorings
• The \(L(2,1)\)-labelling of trees
• Labelling Graphs with a Condition at Distance 2
• Some classes of trees with maximum number of holes two
• On irreducible no‐hole L(2, 1)‐coloring of trees

This page was built for publication: Infinitely many trees with maximum number of holes zero, one, and two