The number of colorings of planar graphs with no separating triangles (Q345111): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56926474 / rank
 
Normal rank
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.jctb.2016.08.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2518957473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COLOURING, PACKING AND THE CRITICAL PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar triangulations with real chromatic roots arbitrarily close to 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-critical graphs on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Zero-Free Intervals for Chromatic Polynomials of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(k\)-colorings of a graph on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest real zero of the chromatic polynomial / rank
 
Normal rank

Latest revision as of 23:38, 12 July 2024

scientific article
Language Label Description Also known as
English
The number of colorings of planar graphs with no separating triangles
scientific article

    Statements

    Identifiers