The following pages link to L'udovít Niepel (Q967347):
Displaying 10 items.
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Supersaturated graphs and hypergraphs (Q787158) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Domination in a digraph and in its reverse (Q967348) (← links)
- The Erdős-Lovász tihany conjecture for quasi-line graphs (Q1043565) (← links)
- Embedding 5-cycle systems into pentagon triple systems (Q1044955) (← links)
- Closure, stability and iterated line graphs with a 2-factor (Q1044973) (← links)
- Large sets of extended directed triple systems with even orders (Q1045191) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
