Prime labelings of infinite graphs

DOI10.2140/involve.2019.12.633zbMath1414.05256OpenAlexW2941683189MaRDI QIDQ2424265

Matthew Kenigsberg, Oscar Levin

Publication date: 24 June 2019

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2019.12.633

zbMATH Keywords

computability theoryinfinite graphsgraph labelingsprime labelings

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Applications of computability and recursion theory (03D80) Infinite graphs (05C63)

Cites Work

• Primality of trees
• Trees are almost prime
• Prime labeling of graphs
• Some Results on Prime and k-Prime Labeling
• Recursive Euler and Hamilton Paths
• Effective coloration
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Prime labelings of infinite graphs