Pages that link to "Item:Q4312248"
From MaRDI portal
The following pages link to A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles (Q4312248):
Displayed 11 items.
- Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) (Q628320) (← links)
- The well-covered dimension of random graphs (Q864120) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets (Q1322267) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- A characterization of well-covered graphs in terms of forbidden costable subgraphs (Q1581458) (← links)
- On 4-connected claw-free well-covered graphs (Q1917239) (← links)
- Well-covered graphs and factors (Q2492219) (← links)
- The structure of well-covered graphs with no cycles of length 4 (Q2643318) (← links)
- Complexity results for well‐covered graphs (Q3993632) (← links)
- (Q4948753) (← links)