On strict-double-bound numbers of complete graphs missing four edges

MaRDI QIDQ5401126zbMATH OpenFDO

Authors Kenjiro Ogawa, Keisuke Kanada, Kanosa Kushima, Satoshi Tagusari, Morimasa Tsuchiya

Publication date 12 March 2014

zbMATH Keywords

strict-double-bound graphstrict-double-bound number

Mathematics Subject Classification ID

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

Recommendations

• Note on strict-double-bound numbers of nearly complete graphs missing some edges
• Note on strict-double-bound graphs and numbers
• On strict-double-bound numbers of complete graphs without edges of stars and pans
• On strict-double-bound numbers of graphs and cut sets
• On strict-double-bound numbers of spiders and ladders

Cited in

(6)

• Note on strict-double-bound graphs and numbers
• On strict-double-bound numbers of complete graphs without edges of stars and pans
• On strict-double-bound numbers of graphs and cut sets
• Note on strict-double-bound numbers of nearly complete graphs missing some edges
• On strict-double-bound numbers of complete pseudo-regular trees
• On strict-double-bound numbers of spiders and ladders

This page was built for publication: On strict-double-bound numbers of complete graphs missing four edges

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