The following pages link to Coding the vertexes of a graph (Q5519690):
Displaying 14 items.
- A note on labeling schemes for graph connectivity (Q763487) (← links)
- On induced-universal graphs for the class of bounded-degree graphs (Q975466) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Simple planar graph partition into three forests (Q1392570) (← 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)
- Average case analysis for tree labelling schemes (Q2371804) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- An unexpected result in coding the vertices of a graph (Q2527412) (← links)
- Informative labeling schemes for graphs (Q2566038) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- On Universal Graphs of Minor Closed Families (Q5300987) (← links)
- Implicit representation of relations (Q6185606) (← links)
