Pages that link to "Item:Q1602692"
From MaRDI portal
The following pages link to On the computational complexity of strong edge coloring (Q1602692):
Displaying 27 items.
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- The strong chromatic index of Halin graphs (Q411659) (← links)
- On the strong chromatic index of cubic Halin graphs (Q419099) (← links)
- On the complexity of the flow coloring problem (Q499367) (← links)
- Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689) (← links)
- Local algorithms for edge colorings in UDGs (Q638541) (← links)
- NP-completeness of edge-colouring some restricted graphs (Q1173977) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Proof of a conjecture on the strong chromatic index of Halin graphs (Q2043362) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- Injective colouring for H-free graphs (Q2117071) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q2154095) (← links)
- A characterization of well-indumatchable graphs having girth greater than seven (Q2172407) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- Strong edge chromatic index of the generalized Petersen graphs (Q2423067) (← links)
- Strong edge-colouring and induced matchings (Q2445264) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← links)
- Bounds and complexity results for strong edge colouring of subcubic graphs (Q2857388) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- (Q5874489) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q6090539) (← links)
- Strong chromatic index of generalized Jahangir graphs and generalized Helm graphs (Q6115751) (← links)
- Strong edge coloring of subquartic graphs (Q6606224) (← links)
