The following pages link to Zdzisław Skupień (Q210379):
Displaying 50 items.
- Edge decompositions of multigraphs into 3-matchings (Q704855) (← links)
- Large Isaacs' graphs are maximally non-Hamilton-connected (Q750459) (← links)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
- Trees with maximum number of maximal matchings (Q878628) (← links)
- Pairs of trees in tree--tree triangulations (Q878648) (← links)
- On cycle lengths in claw-free graphs with complete closure (Q960969) (← links)
- Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree (Q1024512) (← links)
- Inducing regulation of any digraphs (Q1028421) (← links)
- Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles (Q1045171) (← links)
- On detour homogeneous digraphs (Q1045177) (← links)
- (Q1121911) (redirect page) (← links)
- (Q1161756) (redirect page) (← links)
- A catalogue of small maximal nonhamiltonian graphs (Q1161757) (← links)
- Maximum nonhamiltonian tough graphs (Q1185081) (← links)
- Self-converse and oriented graphs among the third parts of nearly complete digraphs (Q1307356) (← links)
- The complete graph \(t\)-packings and \(t\)-coverings (Q1313352) (← links)
- (Q1363000) (redirect page) (← links)
- Exact numbers of longest cycles with empty intersection (Q1363001) (← links)
- Hamiltonicity of planar cubic multigraphs (Q1613479) (← links)
- Extremal irregular digraphs (Q1649914) (← links)
- A smallest irregular oriented graph containing a given diregular one (Q1883255) (← links)
- \(W_ v\) cycles in plane graphs (Q1900043) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← links)
- On some third parts of nearly complete digraphs (Q1970585) (← links)
- Majorization and the minimum number of dominating sets (Q2448915) (← links)
- (Q2761048) (← links)
- Smallest Sets of Longest Paths with Empty Intersection (Q2785375) (← links)
- (Q2816042) (← links)
- Counting maximal distance-independent sets in grid graphs (Q2857030) (← links)
- Universal third parts of any complete 2-graph and none of DK_5 (Q2864643) (← links)
- Sums of powered characteristic roots count distance-independent circular sets (Q2866463) (← links)
- (Q2894653) (← links)
- (Q3072495) (← links)
- On extremal sizes of locally k-tree graphs (Q3073497) (← links)
- (Q3199443) (← links)
- (Q3201097) (← links)
- (Q3204480) (← links)
- Decompositions of a complete multidigraph into nonhamiltonian paths (Q3376691) (← links)
- (Q3429486) (← links)
- On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles (Q3439441) (← links)
- Exponentially many hypohamiltonian snarks (Q3439614) (← links)
- (Q3487383) (← links)
- (Q3490023) (← links)
- '3in1' enhanced: Three squared ways to '3in1' GRAPHS (Q3504807) (← links)
- A Sokoban-type game and arc deletion within irregular digraphs of all sizes (Q3504812) (← links)
- Extremum degree sets of irregular oriented graphs and pseudodigraphs (Q3508848) (← links)
- Decompositions of nearly complete digraphs into t isomorphic parts (Q3560782) (← links)
- (Q3659813) (← links)
- (Q3710548) (← links)
- GENERAL APPROACH TO LINE GRAPHS OF GRAPHS (Q3715151) (← links)
