The adjacent vertex distinguishing total coloring of planar graphs
From MaRDI portal
Publication:2444142
DOI10.1007/s10878-012-9527-2zbMath1319.90076OpenAlexW1967155492MaRDI QIDQ2444142
Publication date: 8 April 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9527-2
Related Items (39)
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles ⋮ Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ Strict neighbor-distinguishing total index of graphs ⋮ Adjacent vertex distinguishing total colorings of 2-degenerate graphs ⋮ Distant set distinguishing total colourings of graphs ⋮ Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ Adjacent vertex distinguishing total coloring in split graphs ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ Neighbor sum distinguishing total coloring of 2-degenerate graphs ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ Upper bounds on adjacent vertex distinguishing total chromatic number of graphs ⋮ Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree ⋮ Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ Unnamed Item ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ Neighbor product distinguishing total colorings ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ On the total and AVD-total coloring of graphs ⋮ Neighbor product distinguishing total colorings of 2-degenerate graphs ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs ⋮ Neighbor sum distinguishing total chromatic number of planar graphs ⋮ General vertex-distinguishing total coloring of graphs ⋮ AVD-total-colouring of complete equipartite graphs ⋮ Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs
Cites Work
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- Adjacent vertex distinguishing total coloring of graphs with lower average degree
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- Concise proofs for adjacent vertex-distinguishing total colorings
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- On adjacent-vertex-distinguishing total coloring of graphs
- Every planar map is four colorable
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
This page was built for publication: The adjacent vertex distinguishing total coloring of planar graphs
