Rainbow neighbourhood number of graphs
From MaRDI portal
Publication:3295009
DOI10.22199/issn.0717-6279-2019-03-0030zbMath1442.05060arXiv1703.01089OpenAlexW2968417482MaRDI QIDQ3295009
Sudev Naduvath, Johan Kok, Muhammad Kamran Jamil
Publication date: 30 June 2020
Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.01089
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
On \(J\)-colorability of certain derived graph classes ⋮ Coloring in graphs of twist knots ⋮ \(J\)-coloring of graph operations ⋮ A note on \(J\)-colouring of Jahangir graphs ⋮ Equating two maximum degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Methods of destroying the symmetries of a graph
- An upper bound for the chromatic number of line graphs
- Graph Colorings
- Generalised colouring sums of graphs
- Theb-chromatic number of certain graphs and digraphs
This page was built for publication: Rainbow neighbourhood number of graphs