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-live.demo.openlinksw.com
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
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://helda.helsinki.fi/handle/10138/21365
http://matwbn.icm.edu.pl/ksiazki/cm/cm3/cm3119.pdf
https://webdocs.cs.ualberta.ca/~joe/Coloring/index.html
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://www.springer.com/gb/book/9783319257280
http://portal.acm.org/citation.cfm%3Fid=803884
https://docs.lib.purdue.edu/cgi/viewcontent.cgi%3Farticle=1613&context=cstech
http://mi.mathnet.ru/msb5974
http://www.math-inst.hu/~p_erdos/1951-01.pdf
https://web.archive.org/web/20160310003706/http:/www.math-inst.hu/~p_erdos/1951-01.pdf
dbo:
wikiPageWikiLink
dbr
:Introduction_to_Algorithms
dbr
:Signed_graph
dbr
:Perfectly_orderable_graph
dbc
:NP-complete_problems
dbc
:Computational_problems_in_graph_theory
dbr
:Finite_set
dbr
:Tree_(graph_theory)
dbr
:Glossary_of_graph_theory
dbr
:Register_allocation
dbr
:Wheel_graph
dbr
:Clique_(graph_theory)
dbr
:Communications_of_the_ACM
dbr
:Hadwiger_conjecture_(graph_theory)
dbr
:List_coloring
dbr
:London_Mathematical_Society
dbr
:Map
dbr
:Paul_Erdős
dbr
:Compiler
dbr
:Edge_coloring
dbr
:Frank_Yates
dbr
:Iterated_logarithm
dbr
:Karp's_21_NP-complete_problems
dbr
:Multipartite_graph
dbr
:Dual_graph
dbr
:Integer
dbr
:William_Rowan_Hamilton
dbc
:Graph_theory
dbr
:Royal_Society
dbr
:Infinite_graph
dbr
:Computer_language
dbr
:NP_(complexity)
dbr
:Tutte_polynomial
dbr
:Daniel_Brélaz
dbr
:Euler_characteristic
dbr
:Lecture_Notes_in_Computer_Science
dbr
:Paul_Seymour_(mathematician)
dbr
:Deterministic_algorithm
dbr
:Independent_set_(graph_theory)
dbr
:Matching_(graph_theory)
dbr
:Chromatic_polynomial
dbr
:Semidefinite_programming
dbr
:Mathematics_of_Sudoku
dbr
:Hajós_construction
dbr
:Path_coloring
dbr
:Star_coloring
dbr
:Crossing_number_(graph_theory)
dbr
:Closed-form_expression
dbr
:Branch_and_bound
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:Symmetry_breaking
dbr
:Erdős–Faber–Lovász_conjecture
dbr
:Mathematical_Proceedings_of_the_Cambridge_Philosophical_Society
dbr
:University_College_London
dbr
:Ramsey_theory
dbr
:Symmetric_graph
dbr
:Information_and_Computation
dbr
:Claude_Berge
dbr
:Cycle_graph
dbr
:Chordal_graph
dbr
:Depth-first_search
dbr
:Interval_graph
dbr
:Petersen_graph
dbr
:Clique_problem
dbr
:RP_(complexity)
dbr
:Vertex_(graph_theory)
dbr
:Albertson_conjecture
dbr
:Graph_embedding
dbr
:Greedy_coloring
dbr
:Adjacent-vertex-distinguishing-total_coloring
dbr
:Graph_theory
dbr
:Pedagogy
dbr
:Isomorphism
dbr
:Bipartite_graph
dbc
:Extensions_and_generalizations_of_graphs
dbr
:Greedy_algorithm
dbr
:Maria_Chudnovsky
dbr
:Girth_(graph_theory)
dbr
:Canadian_Journal_of_Mathematics
dbr
:Distributed_algorithm
dbr
:Bridge_(graph_theory)
dbr
:Acyclic_coloring
dbr
:Acyclic_orientation
dbr
:Exact_coloring
dbr
:Cocoloring
dbr
:Induced_subgraph
dbr
:Information_theory
dbr
:Scheduling_(computing)
dbr
:Computer_program
dbr
:Claude_Shannon
dbr
:Recurrence_relation
dbr
:Information_Processing_Letters
dbr
:Processor_register
dbr
:De_Bruijn–Erdős_theorem_(graph_theory)
dbr
:3SAT
dbr
:Augustus_de_Morgan
dbr
:Complete_graph
dbr
:Polynomial
dbr
:Sudoku
dbr
:Arthur_Cayley
dbr
:Permutation
dbr
:Graph_minor
dbr
:Cubic_graph
dbr
:Hadwiger–Nelson_problem
dbr
:Neil_Robertson_(mathematician)
dbr
:Message_passing
dbr
:Crown_graph
dbr
:Grötzsch_graph
dbr
:Indifference_graph
dbr
:Unit_disk_graph
dbr
:Complete_coloring
dbr
:Total_coloring
dbr
:Tree-depth
dbr
:Maximal_independent_set
dbr
:Uniquely_colorable_graph
dbr
:Wolfgang_Haken
dbr
:Approximation_algorithm
dbr
:Kenneth_Appel
dbr
:Polynomial-time_approximation_scheme
dbr
:Intersection_graph
dbr
:Fractional_chromatic_number
dbr
:Fractional_coloring
dbr
:Discrete_Mathematics_(journal)
dbr
:Strong_coloring
dbr
:T-coloring
dbc
:Graph_coloring
dbr
:Four_color_theorem
dbr
:Brooks'_theorem
dbr
:Loop_(graph_theory)
dbr
:Line_graph
dbr
:Pattern_matching
dbr
:Robin_Thomas_(mathematician)
dbr
:Vizing's_theorem
dbr
:Harmonious_coloring
dbr
:Multi-trials_technique
dbr
:Oriented_coloring
dbr
:Uzi_Vishkin
dbr
:Degree_(graph_theory)
dbr
:Dynamic_programming
dbr
:Francis_Guthrie
dbr
:Brute-force_search
dbr
:Defective_coloring
dbr
:Edgeless_graph
dbr
:Planar_graphs
dbr
:Edge_(graph_theory)
dbr
:Axiom_of_choice
dbr
:Graph_(discrete_mathematics)
dbr
:Breadth-first_search
dbc
:NP-hard_problems
dbr
:George_David_Birkhoff
dbr
:Alfred_Kempe
dbr
:Planar_graph
dbr
:Graph_homomorphism
dbr
:Mycielskian
dbr
:Graph_labeling
dbr
:Graph_automorphism
dbr
:Critical_graph
dbr
:Equitable_coloring
dbr
:Rational_point
dbr
:Algebraic_graph_theory
dbr
:Circular_coloring
dbr
:Triangle-free_graph
dbr
:Perfect_graph
dbr
:Symposium_on_Principles_of_Distributed_Computing
dbr
:Gain_graph
dbr
:Gallai–Hasse–Roy–Vitaver_theorem
dbr
:Symposium_on_Foundations_of_Computer_Science
dbr
:Symposium_on_Parallelism_in_Algorithms_and_Architectures
dbr
:Symposium_on_Theory_of_Computing
dbr
:List_edge-coloring
dbr
:Star_(graph_theory)
dbr
:Bandwidth_allocation
dbr
:Lovász_number
dbr
:Distinguishing_coloring
dbr
:Incidence_coloring
dbr
:Interval_edge_coloring
dbr
:Grundy_number
dbr
:Χ-bounded
dbr
:Monochromatic_triangle
dbr
:L(2,1)-coloring
dbr
:L(h,_k)-coloring
dbr
:ACM_SIGACT_News
dbr
:Springer-Verlag
dbr
:SIAM_Journal_on_Computing
dbr
:SIAM_Journal_on_Discrete_Mathematics
dbr
:Strong_perfect_graph_theorem
dbr
:Hamiltonian_coloring
dbr
:Graph_coloring_game
dbr
:Fibonacci_numbers
dbr
:Group_action_(mathematics)
dbr
:Weak_coloring
dbr
:Sum_coloring
dbr
:NP-complete
dbr
:NP-hard
dbr
:Sharp-P-complete
dbr
:Polynomial_time
dbr
:Linear_time
dbr
:B-coloring
dbr
:Heawood
dbr
:DSatur
dbr
:Five_color_theorem
dbr
:Radio_coloring
dbr
:Subcoloring
dbr
:Exact_algorithm
dbr
:Recursive_largest_first_algorithm
dbr
:Compiler_optimization
dbr
:Graph_(graph_theory)
dbr
:Nowhere-zero_flows
dbr
:P_=_NP
dbr
:File:Petersen_graph_3-coloring.svg
dbr
:Journal_of_Algorithms
dbr
:Proceedings_of_the_Cambridge_Philosophical_Society
dbr
:Theory_of_Computing_(journal)
dbr
:Contraction_(graph_theory)
dbr
:Four_color_conjecture
dbr
:FPRAS
dbr
:Friendship_theorem
dbr
:Rank_coloring
dbr
:Spanning_tree_(mathematics)
dbr
:Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness
dbr
:Longest_path
dbr
:Perfect_elimination_ordering
dbr
:Inclusion–exclusion
dbr
:Information_and_Control
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
dbr
:Odd_cycle
dbr
:SIGPLAN_Symposium_on_Compiler_Construction
dbr
:Tree_graph
dbr
:Tutte
dbr
:Unsolved_problems_in_mathematics
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-completeness
dbr
:♯P-complete
dbr
:NP-hardness
O
(en)
GT4
(en)
χ
(en)
Does G admit a proper vertex coloring with k colors?
(en)
Chromatic number
(en)
Chromatic polynomial
(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
Jan
(en)
Alexander
(en)
William T.
(en)
dbp:
header
Decision
(en)
Counting problem
(en)
Optimisation
(en)
dbp:
headerstyle
background: #DD9
(en)
dbp:
label
Complexity
(en)
Name
(en)
Approximability
(en)
Garey–Johnson
(en)
Inapproximability
(en)
Input
(en)
Output
(en)
Reduction from
(en)
Running time
(en)
dbp:
labelstyle
font-weight:normal
(en)
dbp:
last
Mycielski
(en)
Tutte
(en)
Zykov
(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
:Mset
dbt
:Commons_category
dbt
:Authority_control
dbt
:Prime
dbt
:Main
dbt
:Reflist
dbt
:Math
dbt
:Anchor
dbt
:Col-begin
dbt
:Col-break
dbt
:Col-end
dbt
:Infobox
dbt
:See_also
dbt
:Sub
dbt
:Sup
dbt
:Citation
dbt
:Harvard_citations
dbt
:Refend
dbt
:Sfnp
dbt
:Refbegin
dbt
:MR
dbt
:Mvar
dbt
:Log-star
dbt
:Brace
dbt
:Harv
dbt
:Harvtxt
dbt
:Slink
dbt
:Vanchor
dbt
:Xref
dbt
:Webarchive
dbt
:Tmath
dbt
:Short_description
dbt
:Pprime
dbp:
year
1947
(xsd:integer)
1949
(xsd:integer)
1955
(xsd:integer)
dct:
subject
dbc
:NP-complete_problems
dbc
:Computational_problems_in_graph_theory
dbc
:Graph_theory
dbc
:Extensions_and_generalizations_of_graphs
dbc
:Graph_coloring
dbc
:NP-hard_problems
gold:
hypernym
dbr
:Case
rdf:
type
owl
:Thing
owl
:Thing
rdfs:
label
Graph coloring
(en)
مسألة تلوين المخطط
(ar)
Coloració de grafs
(ca)
Barvení grafu
(cs)
Χρωματισμός γραφήματος
(el)
Grafo koloreztaketa
(eu)
Färbung (Graphentheorie)
(de)
Coloración de grafos
(es)
Colorazione dei grafi
(it)
Coloration de graphe
(fr)
グラフ彩色
(ja)
Kolorowanie grafu
(pl)
그래프 색칠
(ko)
Kleuren van grafen
(nl)
Coloração de grafos
(pt)
Раскраска графов
(ru)
Розфарбовування графів
(uk)
Graffärgning
(sv)
图着色问题
(zh)
rdfs:
seeAlso
dbr
:Four_color_theorem
owl:
sameAs
yago-res
:Graph coloring
freebase
:Graph coloring
wikidata
:Graph coloring
dbpedia-it
:Graph coloring
dbpedia-nl
:Graph coloring
dbpedia-de
:Graph coloring
dbpedia-fr
:Graph coloring
dbpedia-zh
:Graph coloring
dbpedia-ja
:Graph coloring
dbpedia-pt
:Graph coloring
dbpedia-he
:Graph coloring
dbpedia-ro
:Graph coloring
dbpedia-es
:Graph coloring
dbpedia-hu
:Graph coloring
dbpedia-fa
:Graph coloring
dbpedia-ru
:Graph coloring
dbpedia-sv
:Graph coloring
dbpedia-vi
:Graph coloring
dbpedia-pl
:Graph coloring
dbpedia-ko
:Graph coloring
dbpedia-el
:Graph coloring
dbpedia-et
:Graph coloring
dbpedia-ca
:Graph coloring
dbpedia-ar
:Graph coloring
dbpedia-cs
:Graph coloring
dbpedia-cy
:Graph coloring
dbpedia-eu
: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
dbr
:Graph coloring
prov:
wasDerivedFrom
wikipedia-en
:Graph_coloring?oldid=1290658752&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Map_of_United_States_vivid_colors_shown.png
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/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
:3-colourability
dbr
:Vertex_chromatic_number
dbr
:Mycielski's_theorem
dbr
:Mycielski's_theorem
dbr
:K-chromatic_graph
dbr
:K-colorable
dbr
:K-coloring
dbr
:K-colouring
dbr
:K-vertex_colorable
dbr
:Map_coloring_(mathematics)
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
:Three-Colorable_Graph
dbr
:Three-colorable_graph
dbr
:Decentralized_graph_coloring
dbr
:Network_coloring
dbr
:Network_colouring
dbr
:Face_coloring
dbr
:Distributed_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
:Computational_complexity_of_graph_coloring
dbr
:Parallel_algorithms_for_graph_coloring
dbr
:Algorithms_for_graph_coloring
dbr
:Two-colorable_graph
dbr
:Proper_coloring
dbr
:Unlabeled_coloring
dbr
:Vector_chromatic_number
dbr
:Vertex-colouring
dbr
:Vertex_color
dbr
:Vertex_coloring
is
dbo:
wikiPageWikiLink
of
dbr
:Parameterized_complexity
dbr
:Signed_graph
dbr
:HeuristicLab
dbr
:Lieb's_square_ice_constant
dbr
:Distributed_constraint_optimization
dbr
:Hortensia_Galeana_Sánchez
dbr
:Glossary_of_graph_theory
dbr
:Hall-type_theorems_for_hypergraphs
dbr
:Latin_square
dbr
:Register_allocation
dbr
:Erdős–Ko–Rado_theorem
dbr
:Robin_Wilson_(mathematician)
dbr
:Constraint_satisfaction_problem
dbr
:Hadwiger_conjecture_(combinatorial_geometry)
dbr
:Hadwiger_conjecture_(graph_theory)
dbr
:List_coloring
dbr
:Road_coloring_theorem
dbr
:Colin_de_Verdière_graph_invariant
dbr
:Unit_distance_graph
dbr
:Edge_coloring
dbr
:Iterated_logarithm
dbr
:Karp's_21_NP-complete_problems
dbr
:Multipartite_graph
dbr
:Dual_graph
dbr
:Heawood_conjecture
dbr
:Perfect_graph_theorem
dbr
:List_of_NP-complete_problems
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:Rook's_graph
dbr
:Sumner's_conjecture
dbr
:Tutte_polynomial
dbr
:Voltage_graph
dbr
:Walter_Gottschalk
dbr
:Hugo_Hadwiger
dbr
:David_Eppstein
dbr
:András_Hajnal
dbr
:Boolean_prime_ideal_theorem
dbr
:Independent_set_(graph_theory)
dbr
:Chromatic_polynomial
dbr
:Clique_cover
dbr
:Eugene_Lawler
dbr
:Mathematics_of_Sudoku
dbr
:Barnette's_conjecture
dbr
:Claw-free_graph
dbr
:Courcelle's_theorem
dbr
:Hadwiger_number
dbr
:Hajós_construction
dbr
:Path_coloring
dbr
:Pathwidth
dbr
:Paul_A._Catlin
dbr
:Maker-Breaker_game
dbr
:Star_coloring
dbr
:Tom_Hull_(mathematician)
dbr
:Combinatorics
dbr
:SL_(complexity)
dbr
:Gregory_Chaitin
dbr
:Frucht's_theorem
dbr
:Answer_set_programming
dbr
:Split_graph
dbr
:Erdős–Faber–Lovász_conjecture
dbr
:5
dbr
:Static_single-assignment_form
dbr
:Chromatic_(disambiguation)
dbr
:Expander_mixing_lemma
dbr
:Exponential_time_hypothesis
dbr
:Factor-critical_graph
dbr
:Fred_Galvin
dbr
:Cycle_double_cover
dbr
:Cycle_space
dbr
:Snark_(graph_theory)
dbr
:Bojan_Mohar
dbr
:Claude_Berge
dbr
:Chordal_graph
dbr
:Self-organized_criticality
dbr
:Hypercube_graph
dbr
:Interval_graph
dbr
:Petersen_graph
dbr
:♯P-complete
dbr
:Albertson_conjecture
dbr
:Bruce_Reed_(mathematician)
dbr
:Graph_power
dbr
:Greedy_coloring
dbr
:Graph_theory
dbr
:Bipartite_graph
dbr
:Chromatic_number
dbr
:Vertex_colouring
dbr
:Acyclic_coloring
dbr
:Acyclic_orientation
dbr
:Even-hole-free_graph
dbr
:Exact_coloring
dbr
:James_Earl_Baumgartner
dbr
:Markov_chain_mixing_time
dbr
:Cocoloring
dbr
:Cograph
dbr
:Col_(game)
dbr
:Java_performance
dbr
:Maria_Hasse
dbr
:Incidence_(graph)
dbr
:Zdeněk_Dvořák
dbr
:Cereceda's_conjecture
dbr
:Herbert_Grötzsch
dbr
:Mihalis_Yannakakis
dbr
:Property_testing
dbr
:De_Bruijn–Erdős_theorem_(graph_theory)
dbr
:3-colourability
dbr
:Sudoku
dbr
:Boolean_satisfiability_problem
dbr
:Graph_minor
dbr
:Neil_Robertson_(mathematician)
dbr
:Art_gallery_problem
dbr
:Longest_path_problem
dbr
:Golomb_graph
dbr
:Indifference_graph
dbr
:Outerplanar_graph
dbr
:Regular_dodecahedron
dbr
:Regular_icosahedron
dbr
:Tietze's_graph
dbr
:Unit_disk_graph
dbr
:Complete_coloring
dbr
:Probabilistic_method
dbr
:Pseudoforest
dbr
:No-three-in-line_problem
dbr
:Nowhere-zero_flow
dbr
:Shadow_Madness
dbr
:Total_coloring
dbr
:Tree-depth
dbr
:Unavoidable_pattern
dbr
:Uniquely_colorable_graph
dbr
:Approximation_algorithm
dbr
:Parity_of_zero
dbr
:LLVM
dbr
:Universal_algebra
dbr
:Branch_and_price
dbr
:Apex_graph
dbr
:Apollonian_network
dbr
:Fractional_coloring
dbr
:Discharging_method_(discrete_mathematics)
dbr
:Disjunctive_graph
dbr
:Distance-hereditary_graph
dbr
:Strong_coloring
dbr
:Scheinerman's_conjecture
dbr
:Schnyder's_theorem
dbr
:T-coloring
dbr
:Packing_in_a_hypergraph
dbr
:Four_color_theorem
dbr
:Brooks'_theorem
dbr
:Expander_graph
dbr
:Linear_programming_relaxation
dbr
:Dilworth's_theorem
dbr
:Chaitin's_algorithm
dbr
:Treewidth
dbr
:Coloring
dbr
:Mirsky's_theorem
dbr
:Routing_and_wavelength_assignment
dbr
:Map_coloring
dbr
:Orientation_(graph_theory)
dbr
:Oriented_coloring
dbr
:Uzi_Vishkin
dbr
:Van_der_Waerden_number
dbr
:Moser_spindle
dbr
:Cayley_graph
dbr
:Defective_coloring
dbr
:Pancake_graph
dbr
:Memetic_algorithm
dbr
:Clebsch_graph
dbr
:Incidence_structure
dbr
:Planar_graph
dbr
:Graph_homomorphism
dbr
:Brouwer–Haemers_graph
dbr
:Clique-width
dbr
:Critical_graph
dbr
:FKG_inequality
dbr
:Belief_propagation
dbr
:Equitable_coloring
dbr
:Algebraic_graph_theory
dbr
:Cavity_method
dbr
:Circular_coloring
dbr
:Colorable
dbr
:Comparability_graph
dbr
:Complexity_of_constraint_satisfaction
dbr
:Grötzsch's_theorem
dbr
:Periodic_graph_(crystallography)
dbr
:Triangle-free_graph
dbr
:Tricolorability
dbr
:Perfect_graph
dbr
:Equidissection
dbr
:Graph_cuts_in_computer_vision
dbr
:1-planar_graph
dbr
:Edge-transitive_graph
dbr
:Gadget_(computer_science)
dbr
:Gallai–Hasse–Roy–Vitaver_theorem
dbr
:Gary_Chartrand
dbr
:Symmetric_hypergraph_theorem
dbr
:List_edge-coloring
dbr
:Vertex_chromatic_number
dbr
:Hereditary_property
dbr
:Arrangement_of_lines
dbr
:Bag_(puzzle)
dbr
:Book_embedding
dbr
:Ebadollah_S._Mahmoodian
dbr
:Chordal_completion
dbr
:Distinguishing_coloring
dbr
:Dually_chordal_graph
dbr
:Frankl–Rödl_graph
dbr
:Incidence_coloring
dbr
:Linear_forest
dbr
:Elizabeth_Wilmer
dbr
:Gyárfás–Sumner_conjecture
dbr
:Nonblocker
dbr
:Χ-bounded
dbr
:Emanuels_Grīnbergs
dbr
:Daniel_Kráľ
dbr
:L(h,_k)-coloring
dbr
:Split_(graph_theory)
dbr
:Lenore_Cowen
dbr
:Graph_Theory,_1736–1936
dbr
:John_R._Isbell
dbr
:Lexicographic_breadth-first_search
dbr
:Quadratic_unconstrained_binary_optimization
dbr
:Quartic_graph
dbr
:Meyniel_graph
dbr
:Precoloring_extension
dbr
:Word-representable_graph
dbr
:Rainbow-independent_set
dbr
:S._A._Choudum
dbr
:Set_splitting_problem
dbr
:Strong_perfect_graph_theorem
dbr
:Hamiltonian_coloring
dbr
:Penny_graph
dbr
:Hanoi_graph
dbr
:Reconfiguration
dbr
:The_Mathematical_Coloring_Book
dbr
:Tolerance_graph
dbr
:Using_the_Borsuk–Ulam_Theorem
dbr
:Art_Gallery_Theorems_and_Algorithms
dbr
:Polyhedra_(book)
dbr
:Pearls_in_Graph_Theory
dbr
:Slicing_the_Truth
dbr
:Taking_Sudoku_Seriously
dbr
:The_Petersen_Graph
dbr
:3-coloring
dbr
:Shift_graph
dbr
:Graph_coloring_game
dbr
:Margit_Voigt
dbr
:Queen's_graph
dbr
:Agnes_M._Herzberg
dbr
:Hardware_watermarking
dbr
:Mycielski's_theorem
dbr
:Betweenness
dbr
:Elementary_Number_Theory,_Group_Theory_and_Ramanujan_Graphs
dbr
:Maekawa's_theorem
dbr
:B-coloring
dbr
:Kristina_Vušković
dbr
:Sudoku_graph
dbr
:Twin-width
dbr
:Order_polynomial
dbr
:Katalin_Vesztergombi
dbr
:DSatur
dbr
:Goldberg–Seymour_conjecture
dbr
:Conflict-free_coloring
dbr
:Splittance
dbr
:Radio_coloring
dbr
:Hedetniemi's_conjecture
dbr
:Constraint_satisfaction
dbr
:SNP_(complexity)
dbr
:Subcoloring
dbr
:Decision_Model_and_Notation
dbr
:Amanda_Montejano
dbr
:Gabriela_Araujo-Pardo
dbr
:Erdős_on_Graphs
dbr
:Janson_inequality
dbr
:K-chromatic_graph
dbr
:K-colorable
dbr
:K-coloring
dbr
:K-colouring
dbr
:K-vertex_colorable
dbr
:110-vertex_Iofinova-Ivanov_graph
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
:Three-Colorable_Graph
dbr
:Three-colorable_graph
dbr
:Decentralized_graph_coloring
dbr
:Network_coloring
dbr
:Network_colouring
dbr
:Face_coloring
dbr
:Distributed_graph_coloring
dbr
:Applications_of_graph_coloring
dbr
:Cole-Vishkin_algorithm
dbr
:Cole–Vishkin_algorithm
dbr
:Colored_graph
dbr
:Coloring_algorithm
dbr
:Coloring_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