A Note on $J$-Colouring of Jahangir Graphs
Johan Kok, Sudev Naduvath
TL;DR
This paper investigates the conditions under which Jahangir graphs can be properly colored using a specific $J$-coloring scheme, expanding understanding of graph coloring in complex graph families.
Contribution
It characterizes the subset of Jahangir graphs that admit a $J$-coloring, generalizing previous results to a broader class of graphs including wheel graphs.
Findings
Identifies Jahangir graphs that admit $J$-coloring
Provides a characterization criterion for $J$-colorability
Includes wheel graphs as a special case
Abstract
In this paper, we discuss -colouring of the family of Jahangir graphs. Note that the family of Jahangir graphs is a wide-ranging family of graphs which by a generalised definition includes wheel graphs. We characterise the subset of Jahangir graphs which admit a -colouring.
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 · graph theory and CDMA systems · Advanced Graph Theory Research