Pages that link to "Item:Q1025519"
From MaRDI portal
The following pages link to Concise proofs for adjacent vertex-distinguishing total colorings (Q1025519):
Displaying 34 items.
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
- The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
- Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← 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)
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) (Q516897) (← links)
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) (Q932658) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (Q1750669) (← 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)
- Inclusion total chromatic number (Q2037565) (← links)
- Strict neighbor-distinguishing total index of graphs (Q2131155) (← links)
- Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← 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)
- General vertex-distinguishing total coloring of graphs (Q2336778) (← links)
- AVD-total-colouring of complete equipartite graphs (Q2341767) (← links)
- On the total-neighbor-distinguishing index by sums (Q2345540) (← links)
- \(d\)-strong total colorings of graphs (Q2346331) (← links)
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 (Q2374166) (← links)
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs (Q2444142) (← links)
- A concise proof for total coloring subcubic graphs (Q2444906) (← links)
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (Q2460105) (← links)
- A note on the adjacent vertex distinguishing total chromatic number of some cubic graphs. (Q2828917) (← links)
- Adjacent-vertex-distinguishing total coloring of indifference graphs (Q2918479) (← links)
- Adjacent vertex distinguishing total colorings of graphs with smaller degrees (Q2923824) (← links)
- (Q3384719) (← links)
- On the total and AVD-total coloring of graphs (Q4956171) (← links)
