COLORING ALGORITHMS ON SUBCUBIC GRAPHS
From MaRDI portal
Publication:5696963
DOI10.1142/S0129054104002285zbMATH Open1101.68735MaRDI QIDQ5696963FDOQ5696963
Authors: San Skulrattanakulchai, Harold N. Gabow 
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Some APX-completeness results for cubic graphs
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- List edge and list total colourings of multigraphs
- Graph theory with applications
- The NP-Completeness of Edge-Coloring
- On the total coloring of certain graphs
- On Total Chromatic Number of a Graph
- Determining the total colouring number is NP-hard
- Three short proofs in graph theory
- Title not available (Why is that?)
- An Efficient Parallel Biconnectivity Algorithm
- The list chromatic index of a bipartite multigraph
- List-colourings of graphs
- List edge colourings of some 1-factorable multigraphs
- Efficient algorithms for Petersen's matching theorem
- Total colouring regular bipartite graphs is NP-hard
- List Total Colourings of Graphs
- Δ-List Vertex Coloring in Linear Time
- Edge-choosability of multicircuits
- On graphs critical with respect to edge-colourings
- Edge-choosability in line-perfect multigraphs
- On list edge-colorings of subcubic graphs
- A note on list-colorings
- 4-edge-coloring graphs of maximum degree 3 in linear time
- Optimal randomized EREW PRAM algorithms for finding spanning forests
- Total choosability of multicircuits I
- Total choosability of multicircuits II
Cited In (12)
- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable
- \(\Delta \)-list vertex coloring in linear time
- 4-edge-coloring graphs of maximum degree 3 in linear time
- The NP-completeness of (1,r)-subcolorability of cubic graphs
- Δ-List Vertex Coloring in Linear Time
- Enumerating the edge-colourings and total colourings of a regular graph
- Coloring subgraphs with restricted amounts of hues
- Algorithms for coloring quadtrees
- Linear colorings of subcubic graphs
- Coloring of pseudocubic graphs in three colors
- Title not available (Why is that?)
- Colorings with few colors: counting, enumeration and combinatorial bounds
This page was built for publication: COLORING ALGORITHMS ON SUBCUBIC GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696963)
