Total equitable list coloring
From MaRDI portal
Publication:1756126
DOI10.1007/s00373-018-1965-xzbMath1402.05071arXiv1803.07450OpenAlexW2963869717MaRDI QIDQ1756126
Jeffrey A. Mudrock, Michael J. Pelsmajer, Hemanshu Kaul
Publication date: 11 January 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.07450
Related Items (4)
On Equitable List Arboricity of Graphs ⋮ A note on the equitable choosability of complete bipartite graphs ⋮ On list equitable total colorings of the generalized theta graph ⋮ On the equitable choosability of the disjoint union of stars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List edge and list total coloring of planar graphs with maximum degree 8
- On equitable and equitable list colorings of series-parallel graphs
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- Equitable and equitable list colorings of graphs
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- Equitable list colorings of planar graphs without short cycles
- Equitable list coloring of planar graphs without 4- and 6-cycles
- Equitable total coloring of \(C_m\square C_n\)
- Equitable total coloring of \(F_n \vee W_n\)
- Equitable coloring and the maximum degree
- List edge and list total colourings of multigraphs
- Choosability of powers of circuits
- Equitable total coloring of graphs with maximum degree 3
- On equitable coloring of bipartite graphs
- Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable
- Equitable total coloring of corona of cubic graphs
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
- New global optima results for the Kauffman \(NK\) model: Handling dependency
- Equitable List Coloring of Graphs with Bounded Degree
- Equitable Coloring
- A list analogue of equitable coloring
- Total choosability of multicircuits I
- Total choosability of multicircuits II
- The infamous upper tail
- On chromatic‐choosable graphs
- Counterexamples to the List Square Coloring Conjecture
- Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Perfect Graphs and an Application to Optimizing Municipal Services
- Choosability conjectures and multicircuits
This page was built for publication: Total equitable list coloring
