Pages that link to "Item:Q4575816"
From MaRDI portal
The following pages link to Optimal induced universal graphs for bounded-degree graphs (Q4575816):
Displaying 11 items.
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- Induced-universal graphs for graphs with bounded maximum degree (Q844226) (← links)
- On induced-universal graphs for the class of bounded-degree graphs (Q975466) (← links)
- Computing the number of induced copies of a fixed graph in a bounded degree graph (Q1741847) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Induced Universal Hypergraphs (Q4631098) (← links)
- Near-Optimal Induced Universal Graphs for Bounded Degree Graphs (Q5111460) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- (Q6065428) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)