The following pages link to (Q3824455):
Displaying 50 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Total edge irregularity strength of generalized prism (Q272396) (← links)
- On edge irregularity strength of graphs (Q279981) (← links)
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- Irregular labelings of helm and sun graphs (Q322003) (← links)
- The 1,2-conjecture for powers of cycles (Q324730) (← links)
- A survey of irregularity strength (Q324899) (← links)
- Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
- Decomposing oriented graphs into six locally irregular oriented graphs (Q343709) (← links)
- Gap vertex-distinguishing edge colorings of graphs (Q456892) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- On bounds for the product irregularity strength of graphs (Q497327) (← links)
- Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
- On the edge irregularity strength of corona product of cycle with isolated vertices (Q504143) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- The sigma chromatic number of a graph (Q607685) (← links)
- Irregularity strength of regular graphs of large degree (Q685644) (← links)
- An iterative approach to graph irregularity strength (Q708356) (← links)
- On the total vertex irregularity strength of trees (Q710612) (← links)
- On irregular total labellings (Q878629) (← links)
- On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
- Edge colouring by total labellings (Q960914) (← links)
- Total edge irregularity strength of complete graphs and complete bipartite graphs (Q960943) (← links)
- Edge irregular total labellings for graphs of linear size (Q1043545) (← links)
- A new upper bound for the total vertex irregularity strength of graphs (Q1045029) (← links)
- deBruijn-like sequences and the irregular chromatic number of paths and cycles (Q1045102) (← links)
- Irregularity strength of digraphs (Q1045122) (← links)
- Product irregularity strength of graphs (Q1045179) (← links)
- The irregularity strength of \(tP_ 3\) (Q1182742) (← links)
- On the number of irregular assignments on a graph (Q1182886) (← links)
- Irregular weighting of 1-designs (Q1331997) (← links)
- Irregularity strength of the toroidal grid (Q1356786) (← links)
- Vertex-distinguishing edge-colorings of 2-regular graphs (Q1373171) (← links)
- The irregularity cost of a graph (Q1388975) (← links)
- Irregularity strength of trees (Q1584380) (← links)
- A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
- Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs (Q1634474) (← links)
- Computing the irregularity strength of planar graphs (Q1634487) (← links)
- Note on group irregularity strength of disconnected graphs (Q1643408) (← links)
- On edge irregular reflexive labellings for the generalized friendship graphs (Q1649059) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- Colourings of graphs by labellings (Q1687834) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
- Distant total irregularity strength of graphs via random vertex ordering (Q1699557) (← links)
- Distant total sum distinguishing index of graphs (Q1712511) (← links)
- On irregularity strength of diamond network (Q1713619) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- On entire face irregularity strength of disjoint union of plane graphs (Q1736136) (← links)
- Irregular labelings of circulant graphs (Q1761466) (← links)
