The following pages link to Tilings in graphons (Q2225467):
Displaying 16 items.
- Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs (Q511402) (← links)
- First steps in combinatorial optimization on graphons: matchings (Q1689941) (← links)
- Flows on measurable spaces (Q2041865) (← links)
- Fractional isomorphism of graphons (Q2095107) (← links)
- Independent sets, cliques, and colorings in graphons (Q2189827) (← links)
- Matching polytons (Q2278115) (← links)
- Tiling algebra for constraint-based layout editing (Q2397041) (← links)
- Plabic graphs and zonotopal tilings (Q2632711) (← links)
- (Q3322118) (← links)
- (Q3429479) (← links)
- Tessellation graph characterization using rosettas (Q3715156) (← links)
- (Q4868112) (← links)
- Counting Tilings by Taking Walks in a Graph (Q5118416) (← links)
- Komlós's tiling theorem via graphon covers (Q5379813) (← links)
- A median-type condition for graph tiling (Q5915833) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)