Sudoku number of graphs

Sudoku number of graphs

AbstractWe introduce a concept in graph coloring motivated by the popular Sudoku puzzle. Let [Formula: see text] be a graph of order n with chromatic number [Formula: see text] and let [Formula: see text] Let [Formula: see text] be a k-coloring of the induced subgraph [Formula: see text] The colorin...

Full description

Bibliographic Details
Main Authors: J. Maria Jeyaseeli, G. C. Lau, W. C. Shiu, S. Arumugam
Format: Article
Language:English
Published: Taylor & Francis Group 2023-05-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Chromatic number
extendable coloring
Sudoku coloring
05C78
05C69
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2023.2218917

Internet

https://www.tandfonline.com/doi/10.1080/09728600.2023.2218917

Similar Items