An upper bound on adaptable choosability of graphs (Q1003583): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2008.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145006492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapted list coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptable choosability of planar graphs with sparse short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapted List Coloring of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank

Latest revision as of 03:34, 29 June 2024

scientific article
Language Label Description Also known as
English
An upper bound on adaptable choosability of graphs
scientific article

    Statements