Enumeratively chromatic-choosable theta graphs
From MaRDI portal
Cites work
- A determinant formula for the number of ways of coloring a map.
- An improved lower bound of P(G,L)-P(G,k) for k-assignments L
- Bounding the list color function threshold from above
- Chromatic Roots are Dense in the Whole Complex Plane
- Classifying coloring graphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 578417 (Why is no real title available?)
- List coloring and n-monophilic graphs.
- Non-chromatic-adherence of the DP color function via generalized theta graphs
- On chromatic‐choosable graphs
- On list equitable total colorings of the generalized theta graph
- On polynomial representations of the DP color function: theta graphs and their generalizations
- On the chromatic polynomial and counting DP-colorings of graphs
- On the chromatic roots of generalized theta graphs
- On the number of list‐colorings
- On the packing coloring of undirected and oriented generalized theta graphs
- Properly edge-colored theta graphs in edge-colored complete graphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Sum-paintability of generalized theta-graphs
- The chromatic polynomial and list colorings
- The DP color function of clique-gluings of graphs
- When does the list-coloring function of a graph equal its chromatic polynomial
This page was built for publication: Enumeratively chromatic-choosable theta graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444318)