Pages that link to "Item:Q4241100"
From MaRDI portal
The following pages link to Edge-Coloring Problems for Graphs. (Q4241100):
Displaying 16 items.
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs (Q801935) (← links)
- Some sufficient conditions for a graph to be of \(C_f\) 1 (Q812743) (← links)
- A special \(f\)-edge cover-coloring of multigraphs (Q949274) (← links)
- A note on the \((g, f)\)-coloring (Q949352) (← links)
- On resolving edge colorings in graphs (Q1415146) (← links)
- On edge orienting methods for graph coloring (Q2385485) (← links)
- The method of coloring in graphs and its application (Q2429917) (← links)
- Colored problems in graphs (Q2474668) (← links)
- Reachability problems in edge-colored digraphs (Q2643322) (← links)
- Optimal edge-coloring with edge rate constraints (Q2811307) (← links)
- (Q4014299) (← links)
- Edge-Coloring and f-Coloring for Various Classes of Graphs (Q4243441) (← links)
- (Q4887499) (← links)
- Graph endpoint coloring and distributed processing (Q5287442) (← links)
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466) (← links)