Some classes of trees with maximum number of holes two

DOI10.1016/J.AKCEJ.2018.06.010MaRDI QIDQ5154554zbMATH OpenOpenAlexWikidataFDO

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

Publication date 5 October 2021

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.akcej.2018.06.010

zbMATH Keywords

\(L(2,1)\)-coloringirreducible coloringmaximum number of holesspan of a graph

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Recommendations

• Infinitely many trees with maximum number of holes zero, one, and two
• Holes in L(2,1)-coloring on certain classes of graphs
• Solutions of some L(2, 1)-coloring related open problems
• No-hole \(L(2,1)\)-colorings
• Further results on holes in L(2,1) coloring on certain classes of graphs

Cites work

• A complete \(L (2, 1)\) span characterization for small trees
• A note on \(L (2, 1)\)-labelling of trees
• Holes in L(2,1)-coloring on certain classes of graphs
• Labelling Graphs with a Condition at Distance 2
• Solutions of some L(2, 1)-coloring related open problems
• The L(2,1)-labelling of trees

Cited in

(7)

• No-hole \(L(2,1)\)-colorings
• Infinitely many trees with maximum number of holes zero, one, and two
• On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span
• Trees with 2-reinforcement number three
• Further results on holes in L(2,1) coloring on certain classes of graphs
• L(2,1)-coloring and its related problems for Mycielskians of certain classes of graphs
• Irreducible no-hole colorability of circulant graphs

This page was built for publication: Some classes of trees with maximum number of holes two

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