An unexpected result in coding the vertices of a graph

DOI10.1016/0022-247X(67)90082-0MaRDI QIDQ2527412zbMATH OpenOpenAlexFDO

Authors Melvin A. Breuer, Jon Folkman

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

zbMATH Keywords

codingvertices of a graph

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• Codes Identifying Vertices in Graphs
• Vertex codes of graphs
• scientific article; zbMATH DE number 4139806
• On a new class of codes for identifying vertices in graphs
• scientific article; zbMATH DE number 3298614
• Coding the vertices of a graph with Rosenbloom-Tsfasman metric
• Constructing codes identifying sets of vertices
• New bounds for codes identifying vertices in graphs
• Codes associated with the odd graphs

Cites work

• Coding the vertexes of a graph

Cited in

(26)

• Simple planar graph partition into three forests
• Distance labeling scheme and split decomposition
• Distance labeling schemes for well-separated graph classes
• General compact labeling schemes for dynamic trees
• An adjacency labeling scheme based on a decomposition of trees into caterpillars
• Distance and routing labeling schemes for cube-free median graphs
• Average case analysis for tree labelling schemes
• Labeling schemes for weighted dynamic trees
• Informative labeling schemes for graphs
• Threshold-coloring and unit-cube contact representation of planar graphs
• Adjacency labeling schemes and induced-universal graphs
• Network coding in undirected graphs is either very helpful or not helpful at all
• Proximity-preserving labeling schemes
• A Strange Vertex Condition Coming from Nowhere
• List graphs and distance-consistent node labelings
• Distance labeling schemes for cube-free median graphs
• Compact and localized distributed data structures
• On universal graphs of minor closed families
• Coding the vertices of a graph with Rosenbloom-Tsfasman metric
• Short Labels by Traversal and Jumping
• Representing graphs implicitly using almost optimal space
• Implicit representation of relations
• Distance labeling for families of cycles
• Near-optimal vertex fault-tolerant labels for Steiner connectivity
• A note on labeling schemes for graph connectivity
• On induced-universal graphs for the class of bounded-degree graphs

This page was built for publication: An unexpected result in coding the vertices of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2527412)