The following pages link to Recognizing Greedy Structures (Q4864437):
Displaying 30 items.
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- Well-covered triangulations. IV (Q323041) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Extending Berge's and Favaron's results about well-covered graphs (Q394212) (← links)
- 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)
- Mind the independence gap (Q776261) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests (Q882106) (← links)
- Greedily constructing maximal partial \(f\)-factors (Q1025473) (← links)
- Greedy sets and related problems (Q1278939) (← links)
- The uniformity space of hypergraphs and its applications (Q1301700) (← links)
- The structure of well-covered graphs and the complexity of their recognition problems (Q1354731) (← 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)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← 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)
- ModelingK-coteries by well-covered graphs (Q2766106) (← links)
- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 (Q3655148) (← links)
- WELL-COVERED GRAPHS: A SURVEY (Q4288045) (← links)
- A characterization of Zm-well-covered graphs of girth 6 or more (Q4948753) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
- Grundy number of corona product of some graphs (Q6184224) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
- Well-covered graphs with constraints on \(\Delta\) and \(\delta\) (Q6185607) (← links)
