Fractional, Circular, and Defective Coloring of Series-Parallel Graphs
From MaRDI portal
Publication:3466361
DOI10.1002/jgt.21868zbMath1360.05059OpenAlexW2108018147MaRDI QIDQ3466361
Publication date: 1 February 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21868
Related Items
Unnamed Item ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Parameterized (Approximate) Defective Coloring ⋮ Extended double covers and homomorphism bounds of signed graphs ⋮ Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ Defective Coloring on Classes of Perfect Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Circular list colorings of some graphs
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
- The circular chromatic number of series-parallel graphs of large odd girth
- Tight relation between the circular chromatic number and the girth of series-parallel graphs
- List edge-colorings of series-parallel graphs
- Defective choosability results for outerplanar and related graphs
- Partial \(k\)-trees with maximum chromatic number
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- Generalized circular colouring of graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Star chromatic number
- (2 + ?)-Coloring of planar graphs with large odd-girth
- Circular chromatic number: A survey
