d-strong total colorings of graphs

DOI10.1016/J.DISC.2014.07.008MaRDI QIDQ2346331zbMATH OpenOpenAlexFDO

Authors Arnfried Kemnitz, Massimiliano Marangio

Publication date 1 June 2015

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2014.07.008

zbMATH Keywords

cyclecirculant graphpathvertex distinguishing total chromatic numbervertex distinguishing total coloringstrong total chromatic numberstrong total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• \(d\)-strong total colorings of cycles when \(24\leq d\leq 34\)
• \(d\)-strong total colorings of cycles when \(35\leq d\leq 55\)
• d-strong edge colorings of graphs
• Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
• scientific article; zbMATH DE number 1990691

Cites work

• scientific article; zbMATH DE number 5732458 (Why is no real title available?)
• A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
• Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
• Concise proofs for adjacent vertex-distinguishing total colorings
• 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 chromatic number
• Vertex-distinguishing total coloring of graphs
• \(D(\beta)\)-vertex-distinguishing total coloring of graphs

Cited in

(11)

• Distant set distinguishing total colourings of graphs
• scientific article; zbMATH DE number 6096637 (Why is no real title available?)
• Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
• STRONG COLORINGS OVER PARTITIONS
• \(d\)-strong total colorings of cycles when \(24\leq d\leq 34\)
• \(d\)-strong total colorings of cycles when \(35\leq d\leq 55\)
• Strong k-colourings of graphs
• Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
• d-strong edge colorings of graphs
• Strongly set-colorable graphs
• scientific article; zbMATH DE number 5123534 (Why is no real title available?)

This page was built for publication: \(d\)-strong total colorings of graphs

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