Neighbor sum distinguishing index of a kind of sparse graphs

DOI10.6040/J.ISSN.1671-9352.0.2016.326MaRDI QIDQ4640905zbMATH OpenFDO

Authors Wenhua Pan, Changqing Xu

Publication date 25 May 2018

zbMATH Keywords

maximum average degreesparse graphneighbor sum distinguishing edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Recommendations

• Neighbor sum distinguishing index of sparse graphs
• Neighbor sum distinguishing edge colorings of sparse graphs
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
• Neighbor sum distinguishing index
• Neighbor sum distinguishing total coloring of a kind of sparse graph.

Cited in

(6)

• Neighbor sum distinguishing edge colorings of \({K_4}\)-minor free graphs
• Neighbor sum distinguishing index
• Neighbor sum distinguishing index of \(K_4\)-minor free graphs
• Neighbor sum distinguishing index of sparse graphs
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz

This page was built for publication: Neighbor sum distinguishing index of a kind of sparse graphs

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