A class of edge critical 4-chromatic graphs

Guantao Chen; Paul Erdos; András Gyárfás; R. H. Schelp

doi:10.1007/BF03352991

A class of edge critical 4-chromatic graphs

Guantao Chen, Paul Erdos, András Gyárfás, R. H. Schelp

Hungarian Academy of Sciences

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 language	English
Pages (from-to)	139-146
Number of pages	8
Journal	Graphs and Combinatorics
Volume	13
Issue number	2
DOIs	https://doi.org/10.1007/BF03352991
Publication status	Published - Jan 1 1997

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/BF03352991

Fingerprint Dive into the research topics of 'A class of edge critical 4-chromatic graphs'. Together they form a unique fingerprint.

Cite this

Chen, G., Erdos, P., Gyárfás, A., & Schelp, R. H. (1997). A class of edge critical 4-chromatic graphs. Graphs and Combinatorics, 13(2), 139-146. https://doi.org/10.1007/BF03352991

@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 Paul Erdos and Andr{\'a}s Gy{\'a}rf{\'a}s and Schelp, {R. H.}",

year = "1997",

month = jan,

day = "1",

doi = "10.1007/BF03352991",

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 - Erdos, Paul

AU - Gyárfás, András

AU - Schelp, R. H.

PY - 1997/1/1

Y1 - 1997/1/1

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

U2 - 10.1007/BF03352991

DO - 10.1007/BF03352991

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 -