Neighbor sum (set) distinguishing total choosability of d-degenerate graphs

DOI10.1007/S00373-015-1646-YMaRDI QIDQ2631097zbMATH OpenOpenAlexFDO

Authors Jing Jing Yao, Xiaowei Yu, Changqing Xu, Guanghui Wang

Publication date 28 July 2016

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-015-1646-y

zbMATH Keywords

\(d\)-degenerate graphadjacent vertex distinguishing total coloringcombinatorial NullstellensatzList total coloringneighbor sum (set)~~distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• scientific article; zbMATH DE number 7478554
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs

Cites work

• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Combinatorial Nullstellensatz
• Graph theory
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of planar graphs
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• On adjacent-vertex-distinguishing total coloring of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• The adjacent vertex distinguishing total coloring of planar graphs

Cited in

(21)

• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
• Neighbor sum distinguishing total choosability of cubic graphs
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
• Neighbor sum distinguishing total choosability of IC-planar graphs
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
• Neighbor sum distinguishing total chromatic number of planar graphs
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
• Neighbor sum distinguishing total coloring of planar graphs with restrained cycles
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles
• Neighbor sum distinguishing total coloring of graphs with bounded treewidth

This page was built for publication: Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs

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