d-strong total colorings of graphs
From MaRDI portal
Publication:2346331
DOI10.1016/J.DISC.2014.07.008zbMATH Open1315.05055OpenAlexW2017332012MaRDI QIDQ2346331FDOQ2346331
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
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
cyclecirculant graphpathvertex distinguishing total chromatic numbervertex distinguishing total coloringstrong total chromatic numberstrong total coloring
Cites Work
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- On adjacent-vertex-distinguishing total coloring of graphs
- Concise proofs for adjacent vertex-distinguishing total colorings
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
- The adjacent vertex distinguishing total chromatic number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs
- A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data
Cited In (7)
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)
