Pages that link to "Item:Q1028124"
From MaRDI portal
The following pages link to Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124):
Displaying 11 items.
- Decompositions of a polygon into centrally symmetric pieces (Q350249) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Flips in planar graphs (Q950400) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- Gray codes for noncrossing and nonnesting partitions of classical types (Q5365322) (← links)
- On flips in planar matchings (Q5919054) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
