Minimal Graphs with a Specified Code Map Image

DOI10.20429/TAG.2018.050204zbMATH Open1416.05091OpenAlexW2886117924WikidataQ129130898 ScholiaQ129130898MaRDI QIDQ5225549FDOQ5225549

Authors: Paul Feit 

Publication date: 22 July 2019

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20429/tag.2018.050204

Recommendations

• Classifying Resolving Lists by Distances between Members
• scientific article; zbMATH DE number 975345
• The minimum identifying code graphs
• scientific article; zbMATH DE number 1803166
• Codings of graphs with binary edge labels

zbMATH Keywords

treesmetric dimensioncoloringdistance in graph

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (3)

• On the metric representation of the vertices of a graph
• Title not available (Why is that?)
• Classifying Resolving Lists by Distances between Members

This page was built for publication: Minimal Graphs with a Specified Code Map Image

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