Size, chromatic number, and connectivity

J. Bhasker; Tariq Samad; Douglas B. West

doi:10.1007/BF02986667

Size, chromatic number, and connectivity

J. Bhasker, Tariq Samad, Douglas B. West

Technological Leadership Institute

Research output: Contribution to journal › Article › peer-review

Abstract

We consider the minimum number of edges in a k-edge-connected graph of order n with chromatic number at least c, obtaining the optimal bounds in most cases.

Original language	English (US)
Pages (from-to)	209-213
Number of pages	5
Journal	Graphs and Combinatorics
Volume	10
Issue number	2
DOIs	https://doi.org/10.1007/BF02986667
State	Published - Jun 1994

Access

10.1007/BF02986667

Fingerprint Dive into the research topics of 'Size, chromatic number, and connectivity'. Together they form a unique fingerprint.

Cite this

@article{53a682a3f2b049829cbe7ec3c6eaf310,

title = "Size, chromatic number, and connectivity",

abstract = "We consider the minimum number of edges in a k-edge-connected graph of order n with chromatic number at least c, obtaining the optimal bounds in most cases.",

author = "J. Bhasker and Tariq Samad and West, {Douglas B.}",

year = "1994",

month = jun,

doi = "10.1007/BF02986667",

language = "English (US)",

volume = "10",

pages = "209--213",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "2",

}

TY - JOUR

T1 - Size, chromatic number, and connectivity

AU - Bhasker, J.

AU - Samad, Tariq

AU - West, Douglas B.

PY - 1994/6

Y1 - 1994/6

N2 - We consider the minimum number of edges in a k-edge-connected graph of order n with chromatic number at least c, obtaining the optimal bounds in most cases.

AB - We consider the minimum number of edges in a k-edge-connected graph of order n with chromatic number at least c, obtaining the optimal bounds in most cases.

UR - http://www.scopus.com/inward/record.url?scp=84950377285&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84950377285&partnerID=8YFLogxK

U2 - 10.1007/BF02986667

DO - 10.1007/BF02986667

M3 - Article

AN - SCOPUS:84950377285

VL - 10

SP - 209

EP - 213

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 2

ER -