An unexpected result in coding the vertices of a graph
From MaRDI portal
Publication:2527412
DOI10.1016/0022-247X(67)90082-0zbMath0157.25904OpenAlexW2064876674MaRDI QIDQ2527412
Publication date: 1967
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(67)90082-0
Related Items (22)
Average case analysis for tree labelling schemes ⋮ On Universal Graphs of Minor Closed Families ⋮ Threshold-coloring and unit-cube contact representation of planar graphs ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ An adjacency labeling scheme based on a decomposition of trees into caterpillars ⋮ Proximity-preserving labeling schemes ⋮ Simple planar graph partition into three forests ⋮ Implicit representation of relations ⋮ General compact labeling schemes for dynamic trees ⋮ Distance labeling scheme and split decomposition ⋮ Compact and localized distributed data structures ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Labeling schemes for weighted dynamic trees ⋮ Representing graphs implicitly using almost optimal space ⋮ Distance labeling schemes for well-separated graph classes ⋮ On induced-universal graphs for the class of bounded-degree graphs ⋮ Unnamed Item ⋮ Short Labels by Traversal and Jumping ⋮ A note on labeling schemes for graph connectivity ⋮ Informative labeling schemes for graphs ⋮ List graphs and distance-consistent node labelings ⋮ Coding the Vertices of a Graph with Rosenbloom-Tsfasman Metric
Cites Work
This page was built for publication: An unexpected result in coding the vertices of a graph
