1997Discussiones Mathematicae Graph TheoryRequires access

Graph colorings with local constraints -- a survey

Źsolt Tuza

Open publisher page 247 citations

Abstract

Abstract ontents matte number problem where not only a proper coloring o.l Standard definitions has to be found (i.e., adjacent vertices must not receive Q.2 Notation for vertex colorings the same color) but some further local restrictions are im- g ome variations

About this research paper

What this paper is about

Abstract ontents matte number problem where not only a proper coloring o.l Standard definitions has to be found (i.e., adjacent vertices must not receive Q.2 Notation for vertex colorings the same color) but some further local restrictions are im- g ome variations

Why it matters

OpenAlex reports 247 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract ontents matte number problem where not only a proper coloring o.l Standard definitions has to be found (i.e., adjacent vertices must not receive Q.2 Notation for vertex colorings the same color) but some further local restrictions are im- g ome variations

Key concepts: Mathematics, Combinatorics, Graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Graph colorings with local constraints -- a survey — Research Paper | ScholarLens