Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On a question concerning prime distance graphs

From MaRDI portal
Publication:1348134
Jump to:navigation, search

DOI10.1016/S0012-365X(01)00221-7zbMath1001.05052OpenAlexW1992157983MaRDI QIDQ1348134

V. Yegnanarayanan

Publication date: 15 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00221-7


zbMATH Keywords

chromatic numberdistance graph


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)


Related Items (3)

Finite prime distance graphs and 2-odd graphs ⋮ Chromatic coloring of distance graphs, III ⋮ Prime power and prime product distance graphs







This page was built for publication: On a question concerning prime distance graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1348134&oldid=13484331"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki