Greedy coloring
In the study of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color. Greedy colorings can be found in linear time, but they do not in general use the minimum number of colors possible.
Albertson conjectureAndrás HajnalBrooks' theoremCereceda's conjectureChordal graphClaw-free graphCographComparability graphCrown graphDSaturDegeneracy (graph theory)Edge coloringGlossary of graph theoryGraph coloringGraph powerGreedy algorithmGrundy numberHadwiger conjecture (graph theory)Hadwiger numberHeawood conjectureInterval graphLexicographic breadth-first searchMex (mathematics)NP-completenessOuterplanar graphPatrick Michael GrundyPerfect graphPerfectly orderable graphUnit disk graphWell-colored graph
Link from a Wikipage to another Wikipage
primaryTopic
Greedy coloring
In the study of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color. Greedy colorings can be found in linear time, but they do not in general use the minimum number of colors possible.
has abstract
First fit je algoritmus z teor ...... se o tzv. hladový algoritmus.
@cs
In the study of graph coloring ...... use the same number of colors.
@en
Nello studio dei problemi dell ...... colorazioni con pochi colori.
@it
Жадная раскраска в теории граф ...... ски с небольшим числом цветов.
@ru
Жадібне розфарбування в теорії ...... я з невеликим числом кольорів.
@uk
Link from a Wikipage to an external page
Wikipage page ID
21,051,195
page length (characters) of wiki page
Wikipage revision ID
1,024,512,218
Link from a Wikipage to another Wikipage
footer
The triangular prism and squar ...... than-optimal numbers of colors
@en
image
@en
@en
total width
wikiPageUsesTemplate
subject
comment
First fit je algoritmus z teor ...... se o tzv. hladový algoritmus.
@cs
In the study of graph coloring ...... mum number of colors possible.
@en
Nello studio dei problemi dell ...... colorazioni con pochi colori.
@it
Жадная раскраска в теории граф ...... ски с небольшим числом цветов.
@ru
Жадібне розфарбування в теорії ...... я з невеликим числом кольорів.
@uk
label
Colorazione golosa
@it
First fit algoritmus barvení grafu
@cs
Greedy coloring
@en
Жадная раскраска
@ru
Жадібне розфарбовування
@uk