On strict-double-bound numbers of spiders and ladders

MaRDI QIDQ5397227zbMATH OpenFDO

Authors Syota Konishi, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya

Publication date 19 February 2014

zbMATH Keywords

spiderladderstrict-double-bound number

Mathematics Subject Classification ID

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

Recommendations

• Note on strict-double-bound graphs and numbers
• On strict-double-bound numbers of caterpillars
• On strict-double-bound numbers of graphs and cut sets
• On strict-double-bound numbers of complete graphs missing four edges
• On strict-double-bound numbers of complete graphs without edges of stars and pans

Cited in

(7)

• Bounds on the burning numbers of spiders and path-forests
• On strict-double-bound numbers of complete graphs missing four edges
• Note on strict-double-bound graphs and numbers
• On strict-double-bound numbers of graphs and graph operations
• Towers, ladders and the B. B. Newman spelling theorem
• Note on \(p\)-competition graphs of spiders
• On strict-double-bound numbers of caterpillars

This page was built for publication: On strict-double-bound numbers of spiders and ladders

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