Adjacent-vertex-distinguishing total coloring of planar bipartite graphs
From MaRDI portal
Publication:2886280
Recommendations
- The adjacent vertex distinguishing total coloring of planar graphs
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- Adjacent vertex distinguishing index of bipartite planar graphs
- On the adjacent vertex distinguishing total chromatic number of outer plane graph.
Cited in
(6)- scientific article; zbMATH DE number 6843221 (Why is no real title available?)
- On the total and AVD-total coloring of graphs
- Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with =9, 10, or 11
- scientific article; zbMATH DE number 5670856 (Why is no real title available?)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
- Adjacent vertex distinguishing index of bipartite planar graphs
This page was built for publication: Adjacent-vertex-distinguishing total coloring of planar bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2886280)