Pages that link to "Item:Q4243441"
From MaRDI portal
The following pages link to Edge-Coloring and f-Coloring for Various Classes of Graphs (Q4243441):
Displaying 11 items.
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- A note on the \((g, f)\)-coloring (Q949352) (← links)
- A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees (Q1578404) (← links)
- Some results on an edge coloring problem of Folkman and Fulkerson (Q1587594) (← links)
- A classification of edge-colored graphs based on properly colored walks (Q2192112) (← links)
- The edge-labeling and vertex-colors of \(K_n\) (Q2391759) (← links)
- On defected colourings of graphs (Q2439252) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- Edge-Coloring Problems for Graphs. (Q4241100) (← links)
- NP‐completeness of list coloring and precoloring extension on the edges of planar graphs (Q5311921) (← links)
- Algorithms for finding f-colorings of partial k-trees (Q6487980) (← links)