On color critical graphs

Vojtech Rödl, Z. Tuza

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

It is shown that the minimal number of edges which have to be omitted from a (k + 1)-critical graph on n vertices in order to make it bipartite is at least k2 for n large enough. This bound is best possible. Various related questions are considered.

Original languageEnglish
Pages (from-to)204-213
Number of pages10
JournalJournal of Combinatorial Theory. Series B
Volume38
Issue number3
DOIs
Publication statusPublished - 1985

Fingerprint

Critical Graph
Color

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On color critical graphs. / Rödl, Vojtech; Tuza, Z.

In: Journal of Combinatorial Theory. Series B, Vol. 38, No. 3, 1985, p. 204-213.

Research output: Contribution to journalArticle

Rödl, Vojtech ; Tuza, Z. / On color critical graphs. In: Journal of Combinatorial Theory. Series B. 1985 ; Vol. 38, No. 3. pp. 204-213.
@article{e3e5c93eab584a198adff46c1acfa4ce,
title = "On color critical graphs",
abstract = "It is shown that the minimal number of edges which have to be omitted from a (k + 1)-critical graph on n vertices in order to make it bipartite is at least k2 for n large enough. This bound is best possible. Various related questions are considered.",
author = "Vojtech R{\"o}dl and Z. Tuza",
year = "1985",
doi = "10.1016/0095-8956(85)90066-8",
language = "English",
volume = "38",
pages = "204--213",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - On color critical graphs

AU - Rödl, Vojtech

AU - Tuza, Z.

PY - 1985

Y1 - 1985

N2 - It is shown that the minimal number of edges which have to be omitted from a (k + 1)-critical graph on n vertices in order to make it bipartite is at least k2 for n large enough. This bound is best possible. Various related questions are considered.

AB - It is shown that the minimal number of edges which have to be omitted from a (k + 1)-critical graph on n vertices in order to make it bipartite is at least k2 for n large enough. This bound is best possible. Various related questions are considered.

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

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

U2 - 10.1016/0095-8956(85)90066-8

DO - 10.1016/0095-8956(85)90066-8

M3 - Article

AN - SCOPUS:2342501941

VL - 38

SP - 204

EP - 213

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 3

ER -