Note on strict-double-bound numbers of nearly complete graphs missing some edges
DOI10.1016/J.DISC.2011.04.021zbMATH Open1238.05148OpenAlexW1988504452MaRDI QIDQ658101FDOQ658101
Authors: Kenjiro Ogawa, Ryoko Soejima, Satoshi Tagusari, Morimasa Tsuchiya 
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
Recommendations
- 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 complete graphs without edges of stars and pans
- On strict-double-bound numbers of graphs and cut sets
- On strict-double-bound numbers of graphs and graph operations
- On lower bounds for numbered complete graphs
- scientific article; zbMATH DE number 895785
- Bounds on double domination numbers of graphs
- The \(t\)-pebbling number of the complete graph with a missing edge
- Bounds for Ramsey numbers of complete graphs dropping an edge
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorics of partially ordered sets (06A07)
Cites Work
Cited In (7)
- 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 complete graphs without edges of stars and pans
- On strict-double-bound numbers of graphs and graph operations
- Note on strict-double-bound numbers of paths, cycles, and wheels
- On strict-double-bound numbers of graphs and cut sets
- On strict-double-bound numbers of complete pseudo-regular trees
This page was built for publication: Note on strict-double-bound numbers of nearly complete graphs missing some edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658101)
