Pages that link to "Item:Q1609524"
From MaRDI portal
The following pages link to Adjacent strong edge coloring of graphs (Q1609524):
Displaying 50 items.
- A note on graph proper total colorings with many distinguishing constraints (Q264189) (← links)
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) (Q358639) (← links)
- Neighbor sum distinguishing index (Q367074) (← links)
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound (Q383771) (← links)
- On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210) (← links)
- Neighbor sum distinguishing index of planar graphs (Q396740) (← links)
- An improved upper bound for the neighbor sum distinguishing index of graphs (Q401154) (← links)
- The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654) (← links)
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles (Q482220) (← links)
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five (Q489739) (← links)
- Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028) (← links)
- Neighbor sum distinguishing edge coloring of subcubic graphs (Q523715) (← links)
- Vertex-distinguishing edge colorings of graphs with degree sum conditions (Q607682) (← links)
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs (Q654244) (← links)
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) (Q681756) (← links)
- 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← links)
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree (Q726516) (← links)
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759) (← links)
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991) (← links)
- On the neighbour-distinguishing index of a graph (Q855303) (← links)
- \(r\)-strong edge colorings of graphs (Q856841) (← links)
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795) (← 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)
- General neighbour-distinguishing index via chromatic number (Q973148) (← links)
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498) (← links)
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes (Q987834) (← 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)
- Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
- Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992) (← links)
- A new type of edge-derived vertex coloring (Q1045165) (← links)
- Neighbor sum distinguishing index of 2-degenerate graphs (Q1680491) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz (Q1709430) (← links)
- Distant total sum distinguishing index of graphs (Q1712511) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- Neighbor sum distinguishing index of subcubic graphs (Q2014224) (← links)
- Inclusion total chromatic number (Q2037565) (← links)
- On \(S\)-packing edge-colorings of graphs with small edge weight (Q2073113) (← links)
- On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs (Q2098173) (← links)
- On the neighbor-distinguishing indices of planar graphs (Q2117565) (← links)