On an upper bound of a graph's chromatic number, depending on the graph's degree and density

Borodin, O.V; Kostochka, A.V

doi:10.1016/0095-8956(77)90037-5

Record: found
Abstract: not found
Article: not found

On an upper bound of a graph's chromatic number, depending on the graph's degree and density

Author(s): O.V Borodin , A.V Kostochka

Publication date Created: October 1977

Publication date (Print): October 1977

Journal: Journal of Combinatorial Theory, Series B

Publisher: Elsevier BV

Read this article at

ScienceOpenPublisher

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Related collections

Author and article information

Journal

Title: Journal of Combinatorial Theory, Series B

Abbreviated Title: Journal of Combinatorial Theory, Series B

Publisher: Elsevier BV

ISSN (Print): 00958956

Publication date Created: October 1977

Publication date (Print): October 1977

Volume: 23

Issue: 2-3

Pages: 247-250

Article

DOI: 10.1016/0095-8956(77)90037-5

SO-VID: e11a422b-d3fa-4dfc-9b2f-ab4273a8a2ea

License:

http://www.elsevier.com/tdm/userlicense/1.0/

History

Data availability:

Comments

Comment on this article

Cited by 26

On Brooks' Theorem for Sparse Graphs
Authors: Jeong Kim
The Graph Coloring Problem: A Bibliographic Survey
Authors: Panos M Pardalos, Thelma Mavridou, Jue Xue
Another bound on the chromatic number of a graph
Authors: Paul Catlin

See all cited by

On an upper bound of a graph's chromatic number, depending on the graph's degree and density

Read this article at

Abstract

Related collections

Plant MYBs

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 1,520

Cited by 26