Note on strict-double-bound numbers of nearly complete graphs missing some edges

DOI10.1016/J.DISC.2011.04.021zbMath1238.05148OpenAlexW1988504452MaRDI QIDQ658101

Ryoko Soejima, Kenjiro Ogawa, Morimasa Tsuchiya, Satoshi Tagusari

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.021

zbMATH Keywords

nearly complete graph missing edgesstrict-double-bound graphstrict-double-bound number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• The competition-common enemy graph of a digraph
• Note on strict-double-bound graphs and numbers

This page was built for publication: Note on strict-double-bound numbers of nearly complete graphs missing some edges