On color critical graphs

Vojtech Rödl, Zsolt 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 k 2 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 - Jun 1985

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this