Open neighbourhood colouring of some path related graphs

zbMATH Open1463.05194MaRDI QIDQ5116205FDOQ5116205

Authors: Narahari Narasimha Swamy, B. Sooryanarayana 

Publication date: 24 August 2020

Full work available at URL: http://mathnet.ru/eng/emj211

Recommendations

• Open neighborhood chromatic number of an antiprism graph
• Path chromatic numbers of graphs
• Colouring Powers of Paths
• Rainbow neighbourhood number of graphs
• The general neighbor-distinguishing total coloring of graphs

zbMATH Keywords

chromatic numbercolouringpower graphtransformation graphopen neighbourhood

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• A dynamic survey of graph labeling
• Title not available (Why is that?)
• Labelling Graphs with a Condition at Distance 2
• Title not available (Why is that?)
• Chromatic graph theory
• Basic properties of total transformation graphs
• A criterion for (non-)planarity of the transformation graph \(G^{xyz}\) when \(xyz = -++\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unsolved graph colouring problems
• Title not available (Why is that?)
• The transformation graph \(G^{xyz}\) when \(xyz = ++-\)
• Open neighborhood chromatic number of an antiprism graph
• Some applications of graph theory to other parts of mathematics.

Cited In (2)

• Open neighborhood chromatic number of an antiprism graph
• Magic sigma coloring of a graph

This page was built for publication: Open neighbourhood colouring of some path related graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116205)