Uniform number of a graph
From MaRDI portal
Recommendations
Cites work
- A dynamic survey of graph labeling
- Disjoint homometric sets in graph
- Distance in graphs -- taking the long view
- Distinct distance sets in a graph
- Hamilton connected graphs
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- Hamiltonian-laceability of star graphs
- scientific article; zbMATH DE number 434900 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- Introduction to algorithms
- On felicitous graphs
- Resolvability in graphs and the metric dimension of a graph
Cited in
(5)- scientific article; zbMATH DE number 3920507 (Why is no real title available?)
- scientific article; zbMATH DE number 4073012 (Why is no real title available?)
- scientific article; zbMATH DE number 178977 (Why is no real title available?)
- scientific article; zbMATH DE number 2109800 (Why is no real title available?)
- Uniformly connected graphs
This page was built for publication: Uniform number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164959)