The following pages link to David Tankus (Q482208):
Displaying 17 items.
- Weighted well-covered claw-free graphs (Q482209) (← links)
- Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) (Q628320) (← links)
- Complexity results for generating subgraphs (Q724239) (← links)
- Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests (Q882106) (← links)
- Greedily constructing maximal partial \(f\)-factors (Q1025473) (← links)
- The structure of well-covered graphs and the complexity of their recognition problems (Q1354731) (← links)
- Well-covered claw-free graphs (Q1924128) (← links)
- Weighted well-covered graphs without cycles of lengths 5, 6 and 7 (Q2059877) (← links)
- Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 (Q2192076) (← links)
- Well-covered graphs without cycles of lengths 4, 5 and 6 (Q2345607) (← links)
- Well-dominated graphs without cycles of lengths 4 and 5 (Q2397523) (← links)
- On relating edges in graphs without cycles of length 4 (Q2447533) (← links)
- (Q2857405) (← links)
- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 (Q3655148) (← links)
- On the Recognition of k-Equistable Graphs (Q5200515) (← links)
- Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
- Well-covered graphs with constraints on \(\Delta\) and \(\delta\) (Q6185607) (← links)
