Pages that link to "Item:Q837164"
From MaRDI portal
The following pages link to Improved edge-coloring with three colors (Q837164):
Displaying 9 items.
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
- Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS (Q4639461) (← links)
- Interpretable random forest model for identification of edge 3-uncolorable cubic graphs (Q6125138) (← links)
- Determining chromatic index of cubic graph with the use of explainable classifiers: a comparative study (Q6671115) (← links)