The following pages link to Jakub Przybyło (Q244962):
Displaying 50 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- On decomposing graphs of large minimum degree into locally irregular subgraphs (Q286116) (← links)
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Neighbor sum distinguishing index (Q367074) (← links)
- Partitioning powers of traceable or Hamiltonian graphs (Q391776) (← links)
- Distant irregularity strength of graphs (Q394284) (← links)
- Can colour-blind distinguish colour palettes? (Q396838) (← links)
- How to personalize the vertices of a graph? (Q402468) (← links)
- Colour-blind can distinguish colour pallets (Q405211) (← links)
- Seifert graphs and the braid index of classical and singular links (Q449120) (← links)
- On minimal arbitrarily partitionable graphs (Q456092) (← links)
- On a directed variation of the 1-2-3 and 1-2 conjectures (Q516801) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- The neighbour-sum-distinguishing edge-colouring game (Q526242) (← links)
- On the structure of arbitrarily partitionable graphs with given connectivity (Q741769) (← links)
- On an extremal problem in the class of bipartite 1-planar graphs (Q907838) (← links)
- (Q1010693) (redirect page) (← links)
- A note on neighbour-distinguishing regular graphs total-weighting (Q1010694) (← links)
- Irregularity strength of regular graphs (Q1010805) (← links)
- Decompositions of pseudographs into closed trails of even sizes (Q1044920) (← links)
- A new upper bound for the total vertex irregularity strength of graphs (Q1045029) (← links)
- A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
- New bounds for locally irregular chromatic index of bipartite and subcubic graphs (Q1631691) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- A note on a directed version of the 1-2-3 conjecture (Q1693177) (← 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)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs (Q2008185) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- On a total version of 1-2-3 conjecture (Q2194539) (← links)
- The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
- On colour-blind distinguishing colour pallets in regular graphs (Q2251135) (← links)
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
- On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← links)
- Asymptotically optimal neighbor sum distinguishing total colorings of graphs (Q2374159) (← links)
- Distant irregularity strength of graphs with bounded minimum degree (Q2410259) (← links)
- On upper bounds for multiple domination numbers of graphs (Q2444571) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
- Largest component and node fault tolerance for grids (Q2656897) (← links)
- On the standard \((2,2)\)-conjecture (Q2662793) (← links)
- Rainbow connection in sparse graphs (Q2866459) (← links)
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz (Q2870508) (← links)
- On the Facial Thue Choice Index via Entropy Compression (Q2930037) (← links)
- Vertex-distinguishing edge-colorings of linear forests (Q3059082) (← links)
- Nonrepetitive list colourings of paths (Q3068765) (← links)
- Asymptotically optimal neighbour sum distinguishing colourings of graphs (Q3460519) (← links)
