Note on strict-double-bound numbers of nearly complete graphs missing some edges
type: Item
instance of: scholarly article
title: Note on strict-double-bound numbers of nearly complete graphs missing some edges
zbMATH Open document ID: 1238.05148
author: Kenjiro Ogawa
author: Ryoko Soejima
author: Satoshi Tagusari
author: Morimasa Tsuchiya
published in: Discrete Mathematics
publication date: 2012-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5996532
zbMATH Keywords: strict-double-bound graph
zbMATH Keywords: strict-double-bound number
zbMATH Keywords: nearly complete graph missing edges
MaRDI profile type: Publication
full work available at URL: j.disc.2011.04.021
OpenAlex ID: W1988504452
cites work: Note on strict-double-bound numbers of paths, cycles, and wheels
cites work: Q3039403
cites work: Note on strict-double-bound graphs and numbers
cites work: The competition-common enemy graph of a digraph
DOI: 10.1016/J.DISC.2011.04.021
Recommended article: Q5401126
Recommended article: Note on strict-double-bound graphs and numbers
Recommended article: On strict-double-bound numbers of complete graphs without edges of stars and pans
Recommended article: On strict-double-bound numbers of graphs and cut sets
Recommended article: On strict-double-bound numbers of graphs and graph operations
Recommended article: On lower bounds for numbered complete graphs
Recommended article: Q4883676
Recommended article: Q3378348
Recommended article: The \(t\)-pebbling number of the complete graph with a missing edge
Recommended article: Bounds for Ramsey numbers of complete graphs dropping an edge
description: scientific article; zbMATH DE number 5996532