Pages that link to "Item:Q1613483"

The following pages link to Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) (Q1613483):

Displaying 35 items.

• A note on graph proper total colorings with many distinguishing constraints (Q264189) (← links)
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
• Vertex-distinguishing proper arc colorings of digraphs (Q298989) (← links)
• Upper bounds on vertex distinguishing chromatic indices of some Halin graphs (Q377916) (← links)
• On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210) (← links)
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
• Vertex-distinguishing E-total colorings of graphs (Q458138) (← links)
• Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654) (← links)
• Edge-distinguishing index of a graph (Q489314) (← links)
• Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph (Q508738) (← links)
• Vertex-distinguishing edge colorings of graphs with degree sum conditions (Q607682) (← links)
• 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← links)
• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759) (← links)
• On the neighbour-distinguishing index of a graph (Q855303) (← 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)
• Arbitrary decompositions into open and closed trails (Q1024460) (← links)
• Concise proofs for adjacent vertex-distinguishing total colorings (Q1025519) (← links)
• An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905) (← links)
• Decompositions of pseudographs into closed trails of even sizes (Q1044920) (← links)
• deBruijn-like sequences and the irregular chromatic number of paths and cycles (Q1045102) (← links)
• Balanced edge colorings. (Q1425105) (← links)
• On the AVDTC of 4-regular graphs (Q2017055) (← links)
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs (Q2132331) (← links)
• AVD-total-colouring of complete equipartite graphs (Q2341767) (← links)
• A note on adjacent strong edge coloring of \(K(n,m)\) (Q2431949) (← links)
• On defected colourings of graphs (Q2439252) (← links)
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (Q2460105) (← links)
• On planar graphs arbitrarily decomposable into closed trails (Q2482349) (← links)
• A new vertex distinguishing total coloring of trees (Q2671015) (← links)
• Point-distinguishing chromatic index of the union of paths (Q2940667) (← links)
• (Q3384719) (← links)
• Decomposition of Complete Bipartite Even Graphs into Closed Trails (Q4802830) (← links)
• The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs (Q5054038) (← links)
• On the AVDTC of Sierpiński-type graphs (Q6153464) (← links)