A class of edge critical 4-chromatic graphs

Guantao Chen, P. Erdős, A. Gyárfás, R. H. Schelp

Research output: Contribution to journal › Article

2 Citations (Scopus)

Abstract

We consider several constructions of edge critical 4-chromatic graphs which can be written as the union of a bipartite graph and a matching. In particular we construct such a graph G with each of the following properties: G can be contracted to a given critical 4-chromatic graph; for each n ≥ 7, G has n vertices and three matching edges (it is also shown that such graphs must have at least 8n/5 edges); G has arbitrary large girth.

Original languageEnglish
Pages (from-to)139-146
Number of pages8
JournalGraphs and Combinatorics
Volume13
Issue number2
Publication statusPublished - 1997

Fingerprint

Graph in graph theory
Girth
Bipartite Graph
Union
Class
Arbitrary

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

A class of edge critical 4-chromatic graphs. / Chen, Guantao; Erdős, P.; Gyárfás, A.; Schelp, R. H.

In: Graphs and Combinatorics, Vol. 13, No. 2, 1997, p. 139-146.

Research output: Contribution to journal › Article

Chen, G, Erdős, P, Gyárfás, A & Schelp, RH 1997, 'A class of edge critical 4-chromatic graphs', Graphs and Combinatorics, vol. 13, no. 2, pp. 139-146.
Chen G, Erdős P, Gyárfás A, Schelp RH. A class of edge critical 4-chromatic graphs. Graphs and Combinatorics. 1997;13(2):139-146.
Chen, Guantao ; Erdős, P. ; Gyárfás, A. ; Schelp, R. H. / A class of edge critical 4-chromatic graphs. In: Graphs and Combinatorics. 1997 ; Vol. 13, No. 2. pp. 139-146.
@article{9bdcff16735f43008a368e7b39efd70b,
title = "A class of edge critical 4-chromatic graphs",
abstract = "We consider several constructions of edge critical 4-chromatic graphs which can be written as the union of a bipartite graph and a matching. In particular we construct such a graph G with each of the following properties: G can be contracted to a given critical 4-chromatic graph; for each n ≥ 7, G has n vertices and three matching edges (it is also shown that such graphs must have at least 8n/5 edges); G has arbitrary large girth.",
author = "Guantao Chen and P. Erdős and A. Gy{\'a}rf{\'a}s and Schelp, {R. H.}",
year = "1997",
language = "English",
volume = "13",
pages = "139--146",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "2",

}

TY - JOUR

T1 - A class of edge critical 4-chromatic graphs

AU - Chen, Guantao

AU - Erdős, P.

AU - Gyárfás, A.

AU - Schelp, R. H.

PY - 1997

Y1 - 1997

N2 - We consider several constructions of edge critical 4-chromatic graphs which can be written as the union of a bipartite graph and a matching. In particular we construct such a graph G with each of the following properties: G can be contracted to a given critical 4-chromatic graph; for each n ≥ 7, G has n vertices and three matching edges (it is also shown that such graphs must have at least 8n/5 edges); G has arbitrary large girth.

AB - We consider several constructions of edge critical 4-chromatic graphs which can be written as the union of a bipartite graph and a matching. In particular we construct such a graph G with each of the following properties: G can be contracted to a given critical 4-chromatic graph; for each n ≥ 7, G has n vertices and three matching edges (it is also shown that such graphs must have at least 8n/5 edges); G has arbitrary large girth.

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

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

M3 - Article

AN - SCOPUS:27644538997

VL - 13

SP - 139

EP - 146

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 2

ER -

Access to Document