Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Graph coloring
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Assignment of colors to elements of a graph subject to certain constraints
Property
Value
dbo:
description
присвоєння кольорів елементам графа з урахуванням певних обмежень
(uk)
přiřazení barev objektům v grafu na základě definovaných omezení
(cs)
αντιστοιχία των κόμβων ενός γραφήματος σε χρώματα ώστε να μην υπάρχουν δύο γειτονικοί κόμβοι με το ίδιο χρώμα
(el)
caso speciale di etichettamento dei grafi
(it)
assignment of colors to elements of a graph subject to certain constraints
(en)
Zuordnung einer Farbe zu jedem Element eines Graphen
(de)
przypisywanie kolorów obiektom grafu zgodnie z narzuconymi regułami
(pl)
частный случай разметки графа
(ru)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Petersen_graph_3-coloring.svg?width=300
dbo:
wikiPageExternalLink
https://web.archive.org/web/20160310003706/http:/www.math-inst.hu/~p_erdos/1951-01.pdf
http://www.math-inst.hu/~p_erdos/1951-01.pdf
http://rhydlewis.eu/gcol/
http://www.adaptivebox.net/research/bookmark/gcpcodes_link.html
http://www.dcg.ethz.ch/publications/podcfp107_schneider_188.pdf
https://graph-coloring.appspot.com/
https://www.springer.com/gb/book/9783319257280
https://helda.helsinki.fi/handle/10138/21365
http://portal.acm.org/citation.cfm%3Fid=803884
http://mi.mathnet.ru/msb5974
http://www.mcs.vuw.ac.nz/~djp/tutte/
http://eprints.biblio.unitn.it/119/1/39.pdf
http://vispo.com/software
http://www.hamilton.ie/ken_duffy/Downloads/cfl.pdf
http://www.hamilton.ie/peterc/downloads/rawnet06.pdf
https://repository.rothamsted.ac.uk/item/98765/the-design-and-analysis-of-factorial-experiments
http://www.dcg.ethz.ch/publications/podc08SW.pdf
https://docs.lib.purdue.edu/cgi/viewcontent.cgi%3Farticle=1613&context=cstech
http://matwbn.icm.edu.pl/ksiazki/cm/cm3/cm3119.pdf
https://webdocs.cs.ualberta.ca/~joe/Coloring/index.html
dbo:
wikiPageWikiLink
dbr
:Crossing_number_(graph_theory)
dbr
:Girth_(graph_theory)
dbr
:Robin_Thomas_(mathematician)
dbr
:Complete_coloring
dbr
:Circular_coloring
dbr
:Fractional_coloring
dbr
:Symposium_on_Foundations_of_Computer_Science
dbr
:Rational_point
dbr
:Vizing's_theorem
dbr
:Clique_(graph_theory)
dbr
:Albertson_conjecture
dbr
:Total_coloring
dbr
:Tree-depth
dbr
:Triangle-free_graph
dbr
:B-coloring
dbr
:DSatur
dbr
:Message_passing
dbr
:Bandwidth_allocation
dbr
:Oriented_coloring
dbr
:Compiler
dbr
:Map
dbr
:Pedagogy
dbr
:Royal_Society
dbr
:Symposium_on_Principles_of_Distributed_Computing
dbr
:University_College_London
dbr
:Claude_Berge
dbr
:Dynamic_programming
dbr
:Maria_Chudnovsky
dbr
:Paul_Seymour_(mathematician)
dbr
:Information_Processing_Letters
dbr
:London_Mathematical_Society
dbr
:Pattern_matching
dbr
:Intersection_graph
dbr
:Monochromatic_triangle
dbr
:Distinguishing_coloring
dbr
:Grundy_number
dbr
:Incidence_coloring
dbr
:Interval_edge_coloring
dbr
:L(2,1)-coloring
dbc
:Computational_problems_in_graph_theory
dbc
:NP-hard_problems
dbr
:Graph_theory
dbr
:Integer
dbr
:William_Rowan_Hamilton
dbr
:Claude_Shannon
dbr
:Scheduling_(computing)
dbr
:Daniel_Brélaz
dbr
:Finite_set
dbr
:Permutation
dbr
:Critical_graph
dbr
:Semidefinite_programming
dbr
:Cocoloring
dbr
:Ramsey_theory
dbr
:Star_coloring
dbr
:Symposium_on_Parallelism_in_Algorithms_and_Architectures
dbr
:T-coloring
dbr
:Arthur_Cayley
dbr
:Brooks'_theorem
dbr
:Greedy_algorithm
dbr
:Grötzsch_graph
dbr
:Loop_(graph_theory)
dbr
:Mycielskian
dbr
:George_David_Birkhoff
dbr
:Tree_(graph_theory)
dbr
:Depth-first_search
dbr
:Graph_minor
dbr
:Lovász_number
dbr
:Radio_coloring
dbr
:Induced_subgraph
dbr
:L(h,_k)-coloring
dbr
:Complete_graph
dbr
:Computer_program
dbr
:Polynomial
dbr
:Sudoku
dbr
:Graph_(discrete_mathematics)
dbr
:Symmetry_breaking
dbr
:Axiom_of_choice
dbr
:Bipartite_graph
dbr
:Hadwiger–Nelson_problem
dbr
:Paul_Erdős
dbr
:Processor_register
dbr
:Kenneth_Appel
dbr
:Alfred_Kempe
dbr
:Lecture_Notes_in_Computer_Science
dbr
:Wheel_graph
dbr
:Glossary_of_graph_theory
dbr
:Neil_Robertson_(mathematician)
dbr
:Tutte_polynomial
dbr
:Crown_graph
dbr
:Indifference_graph
dbr
:Unit_disk_graph
dbr
:Symposium_on_Theory_of_Computing
dbr
:Exact_coloring
dbr
:Hajós_construction
dbr
:Uzi_Vishkin
dbr
:Brute-force_search
dbr
:Hamiltonian_coloring
dbr
:Five_color_theorem
dbr
:Distributed_algorithm
dbr
:Planar_graph
dbr
:Strong_perfect_graph_theorem
dbr
:Approximation_algorithm
dbr
:Information_theory
dbr
:Karp's_21_NP-complete_problems
dbr
:NP_(complexity)
dbr
:Francis_Guthrie
dbr
:Graph_automorphism
dbr
:Interval_graph
dbr
:Petersen_graph
dbr
:Branch_and_bound
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:Communications_of_the_ACM
dbr
:Hadwiger_conjecture_(graph_theory)
dbr
:Introduction_to_Algorithms
dbr
:List_coloring
dbr
:Canadian_Journal_of_Mathematics
dbr
:Equitable_coloring
dbr
:Mathematical_Proceedings_of_the_Cambridge_Philosophical_Society
dbr
:Adjacent-vertex-distinguishing-total_coloring
dbr
:Graph_coloring_game
dbr
:Edge_coloring
dbr
:Frank_Yates
dbr
:Independent_set_(graph_theory)
dbr
:Matching_(graph_theory)
dbr
:Perfect_graph
dbr
:RP_(complexity)
dbr
:Chordal_graph
dbr
:Register_allocation
dbr
:Bridge_(graph_theory)
dbr
:Iterated_logarithm
dbr
:Graph_homomorphism
dbr
:Harmonious_coloring
dbr
:Maximal_independent_set
dbr
:Uniquely_colorable_graph
dbr
:Weak_coloring
dbr
:Polynomial-time_approximation_scheme
dbr
:Four_color_theorem
dbr
:Wolfgang_Haken
dbr
:Isomorphism
dbr
:Subcoloring
dbr
:Deterministic_algorithm
dbr
:Sum_coloring
dbr
:Χ-bounded
dbr
:Edge_(graph_theory)
dbr
:Erdős–Faber–Lovász_conjecture
dbr
:Vertex_(graph_theory)
dbr
:Defective_coloring
dbr
:Graph_embedding
dbr
:Graph_labeling
dbr
:Greedy_coloring
dbr
:SIAM_Journal_on_Computing
dbr
:SIAM_Journal_on_Discrete_Mathematics
dbr
:List_edge-coloring
dbr
:Cycle_graph
dbr
:Breadth-first_search
dbr
:Computer_language
dbr
:Euler_characteristic
dbr
:Signed_graph
dbr
:Degree_(graph_theory)
dbr
:Algebraic_graph_theory
dbr
:Chromatic_polynomial
dbr
:De_Bruijn–Erdős_theorem_(graph_theory)
dbr
:Dual_graph
dbr
:Clique_problem
dbr
:Symmetric_graph
dbr
:Star_(graph_theory)
dbr
:Mathematics_of_Sudoku
dbr
:Discrete_Mathematics_(journal)
dbr
:Acyclic_coloring
dbr
:Acyclic_orientation
dbr
:Recurrence_relation
dbr
:Gallai–Hasse–Roy–Vitaver_theorem
dbr
:Information_and_Computation
dbr
:Strong_coloring
dbr
:Closed-form_expression
dbr
:Edgeless_graph
dbr
:Cubic_graph
dbr
:Line_graph
dbr
:Multipartite_graph
dbr
:Polynomial_time
dbr
:Recursive_largest_first_algorithm
dbr
:Gain_graph
dbc
:Graph_theory
dbc
:Extensions_and_generalizations_of_graphs
dbc
:Graph_coloring
dbr
:Path_coloring
dbc
:NP-complete_problems
dbr
:Perfectly_orderable_graph
dbr
:Fractional_chromatic_number
dbr
:Compiler_optimization
dbr
:Multi-trials_technique
dbr
:Infinite_graph
dbr
:Heawood
dbr
:NP-complete
dbr
:Springer-Verlag
dbr
:Exact_algorithm
dbr
:NP-hard
dbr
:Sharp-P-complete
dbr
:Planar_graphs
dbr
:Fibonacci_numbers
dbr
:Proceedings_of_the_Cambridge_Philosophical_Society
dbr
:Tree_graph
dbr
:Group_action_(mathematics)
dbr
:Augustus_de_Morgan
dbr
:Graph_(graph_theory)
dbr
:Friendship_theorem
dbr
:Linear_time
dbr
:ACM_SIGACT_News
dbr
:FPRAS
dbr
:Four_color_conjecture
dbr
:3SAT
dbr
:Longest_path
dbr
:P_=_NP
dbr
:Rank_coloring
dbr
:Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness
dbr
:Contraction_(graph_theory)
dbr
:Inclusion–exclusion
dbr
:Information_and_Control
dbr
:Journal_of_Algorithms
dbr
:Tutte
dbr
:Nowhere-zero_flows
dbr
:Unsolved_problems_in_mathematics
dbr
:Theory_of_Computing_(journal)
dbr
:Odd_cycle
dbr
:Spanning_tree_(mathematics)
dbr
:Perfect_elimination_ordering
dbr
:SIGPLAN_Symposium_on_Compiler_Construction
dbr
:File:Petersen_graph_3-coloring.svg
dbr
:File:3-coloringEx.svg
dbr
:File:Chromatic_polynomial_of_all_3-vertex_graphs.png
dbr
:File:Graph_with_all_three-colourings_2.svg
dbr
:File:Greedy_colourings.svg
dbr
:Strong_edge_coloring
dbr
:Zero-error_capacity
dbp:
above
Graph coloring
(en)
dbp:
abovestyle
background: #DD9
(en)
dbp:
authorLink
Jan Mycielski
(en)
W. T. Tutte
(en)
Alexander Zykov
(en)
dbp:
data
3
(xsd:integer)
dbr
:NP-hardness
dbr
:♯P-complete
dbr
:NP-completeness
O
(en)
GT4
(en)
Chromatic number
(en)
Chromatic polynomial
(en)
χ
(en)
Does G admit a proper vertex coloring with k colors?
(en)
FPRAS for restricted cases
(en)
Graph G with n vertices.
(en)
Graph G with n vertices. Integer k
(en)
Graph coloring, vertex coloring, k-coloring
(en)
No PTAS unless P = NP
(en)
O unless P = NP
(en)
The number P of proper k-colorings of G
(en)
dbp:
date
2008-04-16
(xsd:date)
2008-07-04
(xsd:date)
dbp:
first
Alexander
(en)
Jan
(en)
William T.
(en)
dbp:
header
Decision
(en)
Counting problem
(en)
Optimisation
(en)
dbp:
headerstyle
background: #DD9
(en)
dbp:
label
Running time
(en)
Name
(en)
Complexity
(en)
Output
(en)
Input
(en)
Approximability
(en)
Garey–Johnson
(en)
Inapproximability
(en)
Reduction from
(en)
dbp:
labelstyle
font-weight:normal
(en)
dbp:
last
Mycielski
(en)
Zykov
(en)
Tutte
(en)
dbp:
url
https://web.archive.org/web/20080416050948/http:/www.mcs.vuw.ac.nz/~djp/tutte/
https://web.archive.org/web/20080704082406/http:/www.adaptivebox.net/research/bookmark/gcpcodes_link.html
dbp:
wikiPageUsesTemplate
dbt
:MR
dbt
:Harvard_citations
dbt
:Brace
dbt
:Anchor
dbt
:Authority_control
dbt
:Citation
dbt
:Col-begin
dbt
:Col-break
dbt
:Col-end
dbt
:Harv
dbt
:Harvtxt
dbt
:Infobox
dbt
:Main
dbt
:Math
dbt
:Mset
dbt
:Mvar
dbt
:Pprime
dbt
:Prime
dbt
:Refbegin
dbt
:Refend
dbt
:Reflist
dbt
:See_also
dbt
:Sfnp
dbt
:Short_description
dbt
:Slink
dbt
:Sub
dbt
:Sup
dbt
:Tmath
dbt
:Vanchor
dbt
:Webarchive
dbt
:Xref
dbt
:Commons_category
dbt
:Log-star
dbp:
year
1947
(xsd:integer)
1949
(xsd:integer)
1955
(xsd:integer)
dct:
subject
dbc
:Computational_problems_in_graph_theory
dbc
:NP-hard_problems
dbc
:Graph_theory
dbc
:Extensions_and_generalizations_of_graphs
dbc
:Graph_coloring
dbc
:NP-complete_problems
gold:
hypernym
dbr
:Case
rdf:
type
owl
:Thing
owl
:Thing
rdfs:
label
Graph coloring
(en)
مسألة تلوين المخطط
(ar)
Barvení grafu
(cs)
Coloració de grafs
(ca)
Χρωματισμός γραφήματος
(el)
Grafo koloreztaketa
(eu)
Färbung (Graphentheorie)
(de)
Coloración de grafos
(es)
Coloration de graphe
(fr)
Colorazione dei grafi
(it)
グラフ彩色
(ja)
그래프 색칠
(ko)
Kolorowanie grafu
(pl)
Kleuren van grafen
(nl)
Coloração de grafos
(pt)
Раскраска графов
(ru)
Розфарбовування графів
(uk)
Graffärgning
(sv)
图着色问题
(zh)
rdfs:
seeAlso
dbr
:Four_color_theorem
owl:
sameAs
freebase
:Graph coloring
yago-res
:Graph coloring
wikidata
:Graph coloring
dbpedia-de
:Graph coloring
dbpedia-es
:Graph coloring
dbpedia-it
:Graph coloring
dbpedia-nl
:Graph coloring
dbpedia-pl
:Graph coloring
dbpedia-fr
:Graph coloring
dbpedia-he
:Graph coloring
dbpedia-hu
:Graph coloring
dbpedia-ja
:Graph coloring
dbpedia-pt
:Graph coloring
dbpedia-ro
:Graph coloring
dbpedia-ru
:Graph coloring
dbpedia-zh
:Graph coloring
dbpedia-sv
:Graph coloring
dbpedia-vi
:Graph coloring
dbpedia-el
:Graph coloring
dbpedia-ko
:Graph coloring
dbpedia-ca
:Graph coloring
dbpedia-et
:Graph coloring
dbpedia-ar
:Graph coloring
dbpedia-cs
:Graph coloring
dbpedia-cy
:Graph coloring
dbpedia-eu
:Graph coloring
dbpedia-fa
:Graph coloring
dbpedia-hr
:Graph coloring
dbpedia-hy
:Graph coloring
dbpedia-lt
:Graph coloring
dbpedia-no
:Graph coloring
dbpedia-simple
:Graph coloring
dbpedia-sk
:Graph coloring
dbpedia-sr
:Graph coloring
dbpedia-ta
:Graph coloring
dbpedia-th
:Graph coloring
dbpedia-uk
:Graph coloring
dbpedia-ur
:Graph coloring
dbpedia-global
:Graph coloring
prov:
wasDerivedFrom
wikipedia-en
:Graph_coloring?oldid=1307300598&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/3-coloringEx.svg
wiki-commons
:Special:FilePath/Chromatic_polynomial_of_all_3-vertex_graphs.png
wiki-commons
:Special:FilePath/Graph_with_all_three-colourings_2.svg
wiki-commons
:Special:FilePath/Greedy_colourings.svg
wiki-commons
:Special:FilePath/Map_of_United_States_vivid_colors_shown.png
wiki-commons
:Special:FilePath/Petersen_graph_3-coloring.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Graph_coloring
is
dbo:
knownFor
of
dbr
:Jan_Mycielski
dbr
:S._A._Choudum
is
dbo:
wikiPageDisambiguates
of
dbr
:Coloring
is
dbo:
wikiPageRedirects
of
dbr
:Chromatic_number
dbr
:Vertex_colouring
dbr
:Mycielski's_theorem
dbr
:Mycielski's_theorem
dbr
:Map_coloring_(mathematics)
dbr
:Network_coloring
dbr
:Network_colouring
dbr
:Proper_coloring
dbr
:Vertex_chromatic_number
dbr
:Graph_Colouring
dbr
:Graph_Two-Coloring
dbr
:Graph_color
dbr
:Graph_coloration
dbr
:Graph_coloring_algorithm
dbr
:Graph_coloring_problem
dbr
:Graph_colouring
dbr
:Graph_colouring_problem
dbr
:Graph_colouring_problems
dbr
:Graph_two-coloring
dbr
:Decentralized_graph_coloring
dbr
:K-chromatic_graph
dbr
:K-colorable
dbr
:K-coloring
dbr
:K-colouring
dbr
:K-vertex_colorable
dbr
:Algorithms_for_graph_coloring
dbr
:Applications_of_graph_coloring
dbr
:Cole-Vishkin_algorithm
dbr
:Cole–Vishkin_algorithm
dbr
:Colored_graph
dbr
:Coloring_algorithm
dbr
:Coloring_problem
dbr
:Colourability
dbr
:Colouring_algorithm
dbr
:Colouring_problem
dbr
:Face_coloring
dbr
:3-colourability
dbr
:Distributed_graph_coloring
dbr
:Computational_complexity_of_graph_coloring
dbr
:Parallel_algorithms_for_graph_coloring
dbr
:Two-colorable_graph
dbr
:Three-Colorable_Graph
dbr
:Three-colorable_graph
dbr
:Unlabeled_coloring
dbr
:Vector_chromatic_number
dbr
:Vertex-colouring
dbr
:Vertex_color
dbr
:Vertex_coloring
is
dbo:
wikiPageWikiLink
of
dbr
:110-vertex_Iofinova-Ivanov_graph
dbr
:Coloring
dbr
:Combinatorics
dbr
:Erdős–Ko–Rado_theorem
dbr
:Herbert_Grötzsch
dbr
:Hypercube_graph
dbr
:Zdeněk_Dvořák
dbr
:Parity_of_zero
dbr
:Clique-width
dbr
:Moser_spindle
dbr
:Complete_coloring
dbr
:Circular_coloring
dbr
:Fractional_coloring
dbr
:FKG_inequality
dbr
:Hanoi_graph
dbr
:Meyniel_graph
dbr
:Graph_Theory,_1736–1936
dbr
:Longest_path_problem
dbr
:Shift_graph
dbr
:Answer_set_programming
dbr
:Maria_Hasse
dbr
:5
dbr
:Art_gallery_problem
dbr
:Albertson_conjecture
dbr
:Pathwidth
dbr
:Total_coloring
dbr
:Tree-depth
dbr
:Triangle-free_graph
dbr
:Tricolorability
dbr
:B-coloring
dbr
:DSatur
dbr
:Pancake_graph
dbr
:Oriented_coloring
dbr
:András_Hajnal
dbr
:Claude_Berge
dbr
:Robin_Wilson_(mathematician)
dbr
:Expander_graph
dbr
:John_R._Isbell
dbr
:Road_coloring_theorem
dbr
:Memetic_algorithm
dbr
:Clique_cover
dbr
:Chordal_completion
dbr
:Distinguishing_coloring
dbr
:Dually_chordal_graph
dbr
:Frankl–Rödl_graph
dbr
:Incidence_coloring
dbr
:Linear_forest
dbr
:Split_(graph_theory)
dbr
:Penny_graph
dbr
:Eugene_Lawler
dbr
:Graph_theory
dbr
:Property_testing
dbr
:Hugo_Hadwiger
dbr
:Latin_square
dbr
:Boolean_satisfiability_problem
dbr
:Colin_de_Verdière_graph_invariant
dbr
:James_Earl_Baumgartner
dbr
:Frucht's_theorem
dbr
:Critical_graph
dbr
:Hereditary_property
dbr
:Equidissection
dbr
:Claw-free_graph
dbr
:Cocoloring
dbr
:Cograph
dbr
:Col_(game)
dbr
:Comparability_graph
dbr
:Janson_inequality
dbr
:Snark_(graph_theory)
dbr
:Star_coloring
dbr
:T-coloring
dbr
:Maekawa's_theorem
dbr
:Probabilistic_method
dbr
:Twin-width
dbr
:Brooks'_theorem
dbr
:Clebsch_graph
dbr
:Graph_minor
dbr
:Bojan_Mohar
dbr
:Book_embedding
dbr
:Branch_and_price
dbr
:Cycle_double_cover
dbr
:Cycle_space
dbr
:Shadow_Madness
dbr
:Mirsky's_theorem
dbr
:Boolean_prime_ideal_theorem
dbr
:Radio_coloring
dbr
:Sudoku_graph
dbr
:Constraint_satisfaction
dbr
:Parameterized_complexity
dbr
:L(h,_k)-coloring
dbr
:Sudoku
dbr
:Bipartite_graph
dbr
:LLVM
dbr
:Treewidth
dbr
:Unit_distance_graph
dbr
:Incidence_structure
dbr
:Lieb's_square_ice_constant
dbr
:Gregory_Chaitin
dbr
:Brouwer–Haemers_graph
dbr
:Fred_Galvin
dbr
:Katalin_Vesztergombi
dbr
:Glossary_of_graph_theory
dbr
:Ebadollah_S._Mahmoodian
dbr
:Neil_Robertson_(mathematician)
dbr
:Tutte_polynomial
dbr
:Golomb_graph
dbr
:Indifference_graph
dbr
:Outerplanar_graph
dbr
:Unit_disk_graph
dbr
:Apex_graph
dbr
:Apollonian_network
dbr
:Emanuels_Grīnbergs
dbr
:Exact_coloring
dbr
:Factor-critical_graph
dbr
:Hadwiger_conjecture_(combinatorial_geometry)
dbr
:Hadwiger_number
dbr
:Hajós_construction
dbr
:Uzi_Vishkin
dbr
:Courcelle's_theorem
dbr
:Decision_Model_and_Notation
dbr
:Hamiltonian_coloring
dbr
:Cereceda's_conjecture
dbr
:Pearls_in_Graph_Theory
dbr
:Slicing_the_Truth
dbr
:Taking_Sudoku_Seriously
dbr
:The_Petersen_Graph
dbr
:Gabriela_Araujo-Pardo
dbr
:Planar_graph
dbr
:Strong_perfect_graph_theorem
dbr
:Approximation_algorithm
dbr
:Grötzsch's_theorem
dbr
:Karp's_21_NP-complete_problems
dbr
:Mihalis_Yannakakis
dbr
:Tietze's_graph
dbr
:Universal_algebra
dbr
:Interval_graph
dbr
:Petersen_graph
dbr
:Elizabeth_Wilmer
dbr
:Dilworth's_theorem
dbr
:Hadwiger_conjecture_(graph_theory)
dbr
:List_coloring
dbr
:Heawood_conjecture
dbr
:Perfect_graph_theorem
dbr
:David_Eppstein
dbr
:Equitable_coloring
dbr
:Split_graph
dbr
:Gary_Chartrand
dbr
:Scheinerman's_conjecture
dbr
:Set_splitting_problem
dbr
:Hedetniemi's_conjecture
dbr
:Daniel_Kráľ
dbr
:Graph_coloring_game
dbr
:Rainbow-independent_set
dbr
:Edge_coloring
dbr
:Independent_set_(graph_theory)
dbr
:Perfect_graph
dbr
:Chordal_graph
dbr
:Register_allocation
dbr
:Iterated_logarithm
dbr
:Graph_homomorphism
dbr
:Arrangement_of_lines
dbr
:Orientation_(graph_theory)
dbr
:Packing_in_a_hypergraph
dbr
:Uniquely_colorable_graph
dbr
:♯P-complete
dbr
:Exponential_time_hypothesis
dbr
:Four_color_theorem
dbr
:Cavity_method
dbr
:1-planar_graph
dbr
:Quadratic_unconstrained_binary_optimization
dbr
:Quartic_graph
dbr
:No-three-in-line_problem
dbr
:Regular_dodecahedron
dbr
:HeuristicLab
dbr
:Subcoloring
dbr
:Nonblocker
dbr
:Χ-bounded
dbr
:Van_der_Waerden_number
dbr
:Erdős–Faber–Lovász_conjecture
dbr
:Defective_coloring
dbr
:Even-hole-free_graph
dbr
:Graph_power
dbr
:Greedy_coloring
dbr
:S._A._Choudum
dbr
:Map_coloring
dbr
:List_edge-coloring
dbr
:Constraint_satisfaction_problem
dbr
:Complexity_of_constraint_satisfaction
dbr
:Self-organized_criticality
dbr
:Cayley_graph
dbr
:Static_single-assignment_form
dbr
:Belief_propagation
dbr
:Edge-transitive_graph
dbr
:Periodic_graph_(crystallography)
dbr
:Signed_graph
dbr
:Regular_icosahedron
dbr
:Polyhedra_(book)
dbr
:Using_the_Borsuk–Ulam_Theorem
dbr
:Chaitin's_algorithm
dbr
:Pseudoforest
dbr
:Algebraic_graph_theory
dbr
:Chromatic_polynomial
dbr
:De_Bruijn–Erdős_theorem_(graph_theory)
dbr
:Dual_graph
dbr
:Linear_programming_relaxation
dbr
:Paul_A._Catlin
dbr
:Mathematics_of_Sudoku
dbr
:Bag_(puzzle)
dbr
:Barnette's_conjecture
dbr
:Distance-hereditary_graph
dbr
:Acyclic_coloring
dbr
:Acyclic_orientation
dbr
:Gadget_(computer_science)
dbr
:Gallai–Hasse–Roy–Vitaver_theorem
dbr
:Rook's_graph
dbr
:Strong_coloring
dbr
:Sumner's_conjecture
dbr
:Chromatic_(disambiguation)
dbr
:Hardware_watermarking
dbr
:Queen's_graph
dbr
:Splittance
dbr
:Bruce_Reed_(mathematician)
dbr
:Walter_Gottschalk
dbr
:Multipartite_graph
dbr
:Colorable
dbr
:List_of_NP-complete_problems
dbr
:Chromatic_number
dbr
:Discharging_method_(discrete_mathematics)
dbr
:Disjunctive_graph
dbr
:Graph_cuts_in_computer_vision
dbr
:Routing_and_wavelength_assignment
dbr
:Java_performance
dbr
:Lexicographic_breadth-first_search
dbr
:Schnyder's_theorem
dbr
:SL_(complexity)
dbr
:Maker-Breaker_game
dbr
:Unavoidable_pattern
dbr
:Agnes_M._Herzberg
dbr
:Tom_Hull_(mathematician)
dbr
:Precoloring_extension
dbr
:The_Mathematical_Coloring_Book
dbr
:Tolerance_graph
dbr
:Nowhere-zero_flow
dbr
:Path_coloring
dbr
:Symmetric_hypergraph_theorem
dbr
:Hortensia_Galeana_Sánchez
dbr
:Betweenness
dbr
:3-coloring
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:SNP_(complexity)
dbr
:Distributed_constraint_optimization
dbr
:Conflict-free_coloring
dbr
:Markov_chain_mixing_time
dbr
:Reconfiguration
dbr
:Goldberg–Seymour_conjecture
dbr
:Hall-type_theorems_for_hypergraphs
dbr
:Voltage_graph
dbr
:Art_Gallery_Theorems_and_Algorithms
dbr
:Incidence_(graph)
dbr
:Amanda_Montejano
dbr
:Expander_mixing_lemma
dbr
:Kristina_Vušković
dbr
:Margit_Voigt
dbr
:Lenore_Cowen
dbr
:Elementary_Number_Theory,_Group_Theory_and_Ramanujan_Graphs
dbr
:Order_polynomial
dbr
:Vertex_colouring
dbr
:Gyárfás–Sumner_conjecture
dbr
:Erdős_on_Graphs
dbr
:Word-representable_graph
dbr
:Mycielski's_theorem
dbr
:Network_coloring
dbr
:Network_colouring
dbr
:Proper_coloring
dbr
:Vertex_chromatic_number
dbr
:Graph_Colouring
dbr
:Graph_Two-Coloring
dbr
:Graph_color
dbr
:Graph_coloration
dbr
:Graph_coloring_algorithm
dbr
:Graph_coloring_problem
dbr
:Graph_colouring
dbr
:Graph_colouring_problem
dbr
:Graph_colouring_problems
dbr
:Graph_two-coloring
dbr
:Decentralized_graph_coloring
dbr
:K-chromatic_graph
dbr
:K-colorable
dbr
:K-coloring
dbr
:K-colouring
dbr
:K-vertex_colorable
dbr
:Algorithms_for_graph_coloring
dbr
:Applications_of_graph_coloring
dbr
:Cole-Vishkin_algorithm
dbr
:Cole–Vishkin_algorithm
dbr
:Colored_graph
dbr
:Coloring_algorithm
dbr
:Coloring_problem
dbr
:Colourability
dbr
:Colouring_algorithm
dbr
:Colouring_problem
is
dbp:
class
of
dbr
:DSatur
is
dbp:
knownFor
of
dbr
:Jan_Mycielski
dbr
:S._A._Choudum
is
rdfs:
seeAlso
of
dbr
:Register_allocation
is
owl:
differentFrom
of
dbr
:Map_coloring
is
foaf:
primaryTopic
of
wikipedia-en
:Graph_coloring
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International