Pages that link to "Item:Q1706114"
From MaRDI portal
The following pages link to Degenerate matchings and edge colorings (Q1706114):
Displaying 12 items.
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- Acyclic Matching in Some Subclasses of Graphs (Q5041209) (← links)
- Disconnected matchings (Q5925688) (← links)
- Disconnected matchings (Q5972267) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Revisiting semistrong edge‐coloring of graphs (Q6199384) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)
