Algorithms for Silver Coloring of Generalized Petersen Graphs
Golnaz Ghasemiesfeh
TL;DR
This paper discusses algorithms related to silver coloring of generalized Petersen graphs, aiming to improve coloring strategies or understanding of these graph structures.
Contribution
Introduces new algorithms for silver coloring of generalized Petersen graphs, advancing the theoretical understanding of their coloring properties.
Findings
New algorithms for silver coloring developed
Improved bounds on coloring parameters established
Potential applications in graph theory and combinatorics
Abstract
This paper has been withdrawn.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · graph theory and CDMA systems