The following pages link to Maximum gap labelings of graphs (Q1944065):
Displaying 10 items.
- The maximal length of a gap between \(r\)-graph Turán densities (Q888628) (← links)
- The \(S\)-\textsc{labeling} problem: an algorithmic tour (Q1647835) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
- New estimates for the gap chromatic number (Q2449176) (← links)
- On the \(S\)-\textsc{Labeling} problem (Q2851476) (← links)
- (Q3024804) (← links)
- On gap-labellings of some families of graphs (Q6048440) (← links)
- Gaps labeling theorem for the bubble-diamond self-similar graphs (Q6059151) (← links)
- Graphs without gap-vertex-labellings: families and bounds (Q6064864) (← links)
