The following pages link to Mariusz Woźniak (Q186129):
Displaying 50 items.
- Neighbor sum distinguishing index (Q367074) (← links)
- Partitioning powers of traceable or Hamiltonian graphs (Q391776) (← links)
- Can colour-blind distinguish colour palettes? (Q396838) (← links)
- How to personalize the vertices of a graph? (Q402468) (← links)
- Seifert graphs and the braid index of classical and singular links (Q449120) (← links)
- On minimal arbitrarily partitionable graphs (Q456092) (← links)
- Edge-distinguishing index of a graph (Q489314) (← links)
- A note on neighbor expanded sum distinguishing index (Q505462) (← 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 cyclic packing of a tree (Q704857) (← links)
- On the structure of arbitrarily partitionable graphs with given connectivity (Q741769) (← links)
- A note on packing two copies of a tree into a graph with small maximum degree (Q785787) (← links)
- On the neighbour-distinguishing index of a graph (Q855303) (← links)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
- A note on decompositions of transitive tournaments (Q868360) (← links)
- Fixed-point-free embeddings of digraphs with small size (Q878623) (← links)
- A Chvátal--Erdős type condition for pancyclability (Q878642) (← links)
- Dense arbitrarily partitionable graphs (Q907823) (← links)
- On-line arbitrarily vertex decomposable trees (Q997067) (← links)
- On self-complementary cyclic packing of forests (Q1010622) (← links)
- Arbitrary decompositions into open and closed trails (Q1024460) (← links)
- Arbitrarily vertex decomposable suns with few rays (Q1025573) (← links)
- Decompositions of pseudographs into closed trails of even sizes (Q1044920) (← links)
- On-line arbitrarily vertex decomposable suns (Q1045163) (← links)
- A note on minimal order of a bipartite graph with exactly \(q\) quadrilaterals (Q1309476) (← links)
- Embedding graphs of small size (Q1329826) (← links)
- Orientations of Hamiltonian cycles in bipartite digraphs (Q1337013) (← links)
- A note on packing of three forests (Q1356715) (← links)
- On graphs which contain each tree of given size (Q1356784) (← links)
- The Erdös-Sós conjecture for graphs without \(C_ 4\) (Q1362105) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- On cyclically embeddable \((n,n-1)\)-graphs (Q1613481) (← links)
- A note on a directed version of the 1-2-3 conjecture (Q1693177) (← links)
- On self-complementary supergraphs of (\(n,n\))-graphs (Q1773368) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- Cycles in Hamiltonian graphs of prescribed maximum degree (Q1810655) (← links)
- A note on pancyclism of highly connected graphs (Q1883250) (← links)
- A note on embedding graphs without short cycles (Q1883254) (← links)
- On the achromatic index of \(K_{q^2+q}\) for a prime \(q\) (Q1889828) (← links)
- Packing three trees (Q1916129) (← links)
- Edge-disjoint placement of three trees (Q1922881) (← links)
- Dense arbitrarily vertex decomposable graphs (Q1928285) (← links)
- Packing two copies of a tree into its fourth power (Q1970711) (← links)
- Minimum number of palettes in edge colorings (Q2014713) (← links)
- On asymmetric colourings of claw-free graphs (Q2048557) (← links)
- A note on packing of uniform hypergraphs (Q2158207) (← links)
- On a total version of 1-2-3 conjecture (Q2194539) (← links)
- On the total-neighbor-distinguishing index by sums (Q2345540) (← links)
