Pages that link to "Item:Q2573644"
From MaRDI portal
The following pages link to \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644):
Displaying 50 items.
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- Neighbor sum distinguishing index (Q367074) (← links)
- On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← 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 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)
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795) (← 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)
- 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)
- 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 the neighbor-distinguishing indices of planar graphs (Q2117565) (← links)
- The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs (Q2172399) (← links)
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles (Q2186285) (← links)
- Two-distance vertex-distinguishing index of sparse subcubic graphs (Q2186287) (← links)
- Neighbor sum distinguishing index of sparse graphs (Q2194737) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs (Q2341729) (← links)
- Some bounds on the neighbor-distinguishing index of graphs (Q2352066) (← links)
- Edge colorings of the direct product of two graphs (Q2354610) (← links)
- Neighbor sum distinguishing edge colorings of sparse graphs (Q2355754) (← links)
- Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs (Q2438328) (← links)
- General neighbour-distinguishing index of a graph (Q2470450) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
