Pages that link to "Item:Q2032162"
From MaRDI portal
The following pages link to Complexity and algorithms for injective edge-coloring in graphs (Q2032162):
Displaying 20 items.
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- Injective edge-coloring of graphs with given maximum degree (Q2033899) (← links)
- List injective edge-coloring of subcubic graphs (Q2043370) (← links)
- Note on injective edge-coloring of graphs (Q2074357) (← links)
- Injective edge chromatic index of generalized Petersen graphs (Q2105277) (← links)
- Injective edge coloring of sparse graphs with maximum degree 5 (Q2111524) (← links)
- Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
- Injective edge coloring for graphs with small edge weight (Q2676764) (← links)
- Injective edge coloring of some sparse graphs (Q6046899) (← links)
- Injective edge-coloring of subcubic graphs (Q6115745) (← links)
- Complexity and algorithms for injective edge coloring of graphs (Q6132966) (← links)
- Injective chromatic index of sparse graphs (Q6145804) (← links)
- Injective edge coloring of graphs with maximum degree 5 (Q6157424) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q6365437) (← links)
- Injective edge chromatic index of generalized Petersen graph \(P(ck,k)\) (Q6542936) (← links)
- Injective edge coloring of some standard graph products (Q6637040) (← links)
- Injective-edge-coloring of planar graphs with girth restriction (Q6637051) (← links)
- Injective edge-coloring of claw-free subcubic graphs (Q6645183) (← links)
- Edge open packing: complexity, algorithmic aspects, and bounds (Q6646442) (← links)
