Unique list-colourability and the fixing chromatic number of graphs (Q2576344): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.04.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023761027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of the product of two 4-chromatic graphs is 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely 2-list colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations with structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2761069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining sets in vertex colorings of graphs and latin rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of uniquely colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Hedetniemi's conjecture / rank
 
Normal rank

Latest revision as of 14:28, 11 June 2024

scientific article
Language Label Description Also known as
English
Unique list-colourability and the fixing chromatic number of graphs
scientific article

    Statements

    Unique list-colourability and the fixing chromatic number of graphs (English)
    0 references
    0 references
    0 references
    27 December 2005
    0 references
    0 references
    uniquely list-colourable graphs
    0 references
    exponential graph construction
    0 references
    0 references