On \(J\)-colorability of certain derived graph classes

DOI10.2478/ausi-2019-0011zbMath1439.05084arXiv1708.09798OpenAlexW3003012627WikidataQ126308812 ScholiaQ126308812MaRDI QIDQ2178741

Sudev Naduvath, Federico Fornasiero

Publication date: 11 May 2020

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.09798

zbMATH Keywords

graph coloringMycielski graphs\(J\)-coloring of graphsrainbow neighbourhoods

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Methods of destroying the symmetries of a graph
• \(J\)-coloring of graph operations
• Several parameters of generalized Mycielskians
• On chromatic Zagreb indices of certain graphs
• Rainbow neighbourhood number of graphs
• Star chromatic number
• Equitable coloring parameters of certain graph classes
• Graph Colorings
• Circular chromatic number: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(J\)-colorability of certain derived graph classes