On strict-double-bound numbers of caterpillars

DOI10.1142/S179383091550038XzbMath1325.05118OpenAlexW2172383377MaRDI QIDQ3451079

Satoshi Tagusari, Yuhei Shiraki, Morimasa Tsuchiya, Kenjiro Ogawa

Publication date: 10 November 2015

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091550038x

zbMATH Keywords

caterpillarstrict-double-bound graphstrict-double-bound number

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• The competition-common enemy graph of a digraph
• Upper maximal graphs of posets
• A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs

This page was built for publication: On strict-double-bound numbers of caterpillars