Pages that link to "Item:Q2574667"

The following pages link to On adjacent-vertex-distinguishing total coloring of graphs (Q2574667):

Displaying 50 items.

• A note on graph proper total colorings with many distinguishing constraints (Q264189) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
• Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
• Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
• The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
• Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
• Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
• Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph (Q508738) (← links)
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
• Neighbor product distinguishing total colorings (Q512884) (← links)
• AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) (Q516897) (← links)
• Improved bounds on linear coloring of plane graphs (Q625757) (← links)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
• \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795) (← links)
• On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
• AVDTC numbers of generalized Halin graphs with maximum degree at least 6 (Q925977) (← links)
• On the adjacent-vertex-strongly-distinguishing total coloring of graphs (Q931507) (← links)
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) (Q932658) (← links)
• Adjacent vertex distinguishing total colorings of outerplanar graphs (Q965812) (← links)
• Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes (Q987834) (← links)
• Concise proofs for adjacent vertex-distinguishing total colorings (Q1025519) (← links)
• Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
• Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992) (← links)
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550) (← links)
• Distant total sum distinguishing index of graphs (Q1712511) (← links)
• A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)
• On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (Q1750669) (← links)
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
• A note on decycling number, vertex partition and AVD-total coloring in graphs (Q1756100) (← links)
• A note on the adjacent vertex distinguishing total chromatic number of graphs (Q1759396) (← links)
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (Q1783617) (← links)
• On the AVDTC of 4-regular graphs (Q2017055) (← links)
• Inclusion total chromatic number (Q2037565) (← links)
• Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten (Q2042610) (← links)
• Strict neighbor-distinguishing total index of graphs (Q2131155) (← links)
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs (Q2132331) (← links)
• Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← links)
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
• Neighbor product distinguishing total colorings of 2-degenerate graphs (Q2292128) (← links)
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)