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

Circular chromatic numbers of a class of distance graphs

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

DOI10.1016/S0012-365X(02)00631-3zbMath1021.05040MaRDI QIDQ1874370

Xuding Zhu

Publication date: 25 May 2003

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


zbMATH Keywords

circular chromatic numberdistance graphstar chromatic number


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)


Related Items (6)

The packing coloring of distance graphs \(D(k,t)\) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ Circular chromatic numbers of some distance graphs ⋮ Sequences of integers with three missing separations ⋮ Coloring of distance graphs with intervals as distance sets







This page was built for publication: Circular chromatic numbers of a class of distance graphs

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