Pages that link to "Item:Q2527412"
From MaRDI portal
The following pages link to An unexpected result in coding the vertices of a graph (Q2527412):
Displaying 22 items.
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- A note on labeling schemes for graph connectivity (Q763487) (← links)
- On induced-universal graphs for the class of bounded-degree graphs (Q975466) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Distance labeling schemes for well-separated graph classes (Q1765518) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- An adjacency labeling scheme based on a decomposition of trees into caterpillars (Q2169946) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- Average case analysis for tree labelling schemes (Q2371804) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Informative labeling schemes for graphs (Q2566038) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Proximity-preserving labeling schemes (Q4948512) (← links)
- List graphs and distance-consistent node labelings (Q5009976) (← links)
- (Q5092373) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- On Universal Graphs of Minor Closed Families (Q5300987) (← links)
- Coding the Vertices of a Graph with Rosenbloom-Tsfasman Metric (Q5867212) (← links)
- Short Labels by Traversal and Jumping (Q5899392) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)
- Implicit representation of relations (Q6185606) (← links)
