COLORING ALGORITHMS ON SUBCUBIC GRAPHS
From MaRDI portal
Publication:5696963
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- 4-edge-coloring graphs of maximum degree 3 in linear time
- A note on list-colorings
- An Efficient Parallel Biconnectivity Algorithm
- Determining the total colouring number is NP-hard
- Edge-choosability in line-perfect multigraphs
- Edge-choosability of multicircuits
- Efficient algorithms for Petersen's matching theorem
- Graph theory with applications
- List Total Colourings of Graphs
- List edge and list total colourings of multigraphs
- List edge colourings of some 1-factorable multigraphs
- List-colourings of graphs
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- On Total Chromatic Number of a Graph
- On graphs critical with respect to edge-colourings
- On list edge-colorings of subcubic graphs
- On the total coloring of certain graphs
- Optimal randomized EREW PRAM algorithms for finding spanning forests
- Some APX-completeness results for cubic graphs
- The NP-Completeness of Edge-Coloring
- The list chromatic index of a bipartite multigraph
- Three short proofs in graph theory
- Total choosability of multicircuits I
- Total choosability of multicircuits II
- Total colouring regular bipartite graphs is NP-hard
- Δ-List Vertex Coloring in Linear Time
Cited in
(12)- Coloring of pseudocubic graphs in three colors
- Enumerating the edge-colourings and total colourings of a regular graph
- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable
- Algorithms for coloring quadtrees
- scientific article; zbMATH DE number 2089961 (Why is no real title available?)
- Coloring subgraphs with restricted amounts of hues
- The NP-completeness of (1,r)-subcolorability of cubic graphs
- 4-edge-coloring graphs of maximum degree 3 in linear time
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Linear colorings of subcubic graphs
- Δ-List Vertex Coloring in Linear Time
- \(\Delta \)-list vertex coloring in linear time
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)
