The number of colorings of planar graphs with no separating triangles
From MaRDI portal
Publication:345111
DOI10.1016/J.JCTB.2016.08.005zbMATH Open1350.05043DBLPjournals/jct/Thomassen17OpenAlexW2518957473WikidataQ56926474 ScholiaQ56926474MaRDI QIDQ345111FDOQ345111
Authors: Carsten Thomassen 
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2016.08.005
Recommendations
- Total colorings of planar graphs without adjacent triangles
- Total colorings of planar graphs with sparse triangles
- Many 3-colorings of triangle-free planar graphs
- On the total coloring of planar graphs.
- Counting colorings of triangle-free graphs
- Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles
- On edge colorings of 1-planar graphs without adjacent triangles
- On acyclic edge coloring of planar graphs without intersecting triangles
- scientific article; zbMATH DE number 881297
- Colorings of planar graphs with no rainbow faces
Cites Work
- Graphs on surfaces
- Graph theory with applications
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- Title not available (Why is that?)
- Color-critical graphs on a fixed surface
- The largest real zero of the chromatic polynomial
- COLOURING, PACKING AND THE CRITICAL PROBLEM
- Chromatic Polynomials
- The number of \(k\)-colorings of a graph on a fixed surface
- Planar triangulations with real chromatic roots arbitrarily close to 4
Cited In (3)
This page was built for publication: The number of colorings of planar graphs with no separating triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345111)
