The following pages link to Adam Paweł Wojda (Q592483):
Displayed 50 items.
- On \((K_q,k)\) vertex stable graphs with minimum size (Q432707) (← links)
- On \((K_{q},k)\) stable graphs with small \(k\) (Q456306) (← links)
- Graphs with every matching contained in a cycle (Q685596) (← links)
- Bipartite graphs with every matching in a cycle (Q878652) (← links)
- Almost symmetric cycles in large digraphs (Q882781) (← links)
- A note on \(t\)-complementing permutations for graphs (Q990101) (← links)
- On self-complementary cyclic packing of forests (Q1010622) (← links)
- Digraphs without directed path of length two or three (Q1068100) (← links)
- The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs (Q1088685) (← links)
- (Q1309453) (redirect page) (← links)
- Mutual placement of bipartite graphs (Q1309454) (← links)
- Orientations of Hamiltonian cycles in bipartite digraphs (Q1337013) (← links)
- Packing bipartite graphs (Q1356720) (← links)
- An upper bound for the Hamiltonicity exponent of finite digraphs (Q1356721) (← links)
- Embedding digraphs of small size (Q1356787) (← links)
- Coloring edges of self-complementary graphs (Q1373172) (← links)
- A condition for a graph to contain \(k\)-matching. (Q1422440) (← links)
- Almost self-complementary uniform hypergraphs (Q1708405) (← links)
- On self-complementary supergraphs of (\(n,n\))-graphs (Q1773368) (← links)
- Cyclic partitions of complete uniform hypergraphs (Q1960272) (← links)
- Graphs with every \(k\)-matching in a Hamiltonian cycle (Q1970707) (← links)
- A note on the colour class of a self-complementary graph (Q1970724) (← links)
- Extending Potočnik and Šajna's conditions on the existence of vertex-transitive self-complementary \(k\)-hypergraphs (Q2107756) (← links)
- Hamiltonian path saturated graphs with small size (Q2492212) (← links)
- Erratum to ``On self-complementary supergraphs of (\(n,n\))-graphs'' [Discrete Math. 292 (2005) 167--185] (Q2581634) (← links)
- (Q2741374) (← links)
- (Q2816145) (← links)
- On minimum (K_q,k) stable graphs (Q2866452) (← links)
- (Q3137221) (← links)
- (Q3208691) (← links)
- (Q3211326) (← links)
- (Q3220619) (← links)
- Some results on placing bipartite graphs of maximum degree two (Q3439450) (← links)
- Self-complementary hypergraphs and their self-complementing permutations (Q3439451) (← links)
- HAMILTONIAN CYCLES THROUGH MATCHINGS (Q3470492) (← links)
- (Q3487384) (← links)
- Self-complementary hypergraphs (Q3508839) (← links)
- On odd and semi-odd linear partitions of cubic graphs (Q3559379) (← links)
- (Q3575448) (← links)
- Independent cycles and paths in bipartite balanced graphs (Q3633844) (← links)
- Extremal traceable graphs with non-traceable edges (Q3639812) (← links)
- On the existence of specified cycles in a tournament (Q3672009) (← links)
- On the Existence of D(n,p) in Directed Graphs (Q3674701) (← links)
- On self‐complementation (Q3714119) (← links)
- Orientations of hamiltonian cycles in large digraphs (Q3722529) (← links)
- (Q3735726) (← links)
- (Q3745879) (← links)
- (Q3800076) (← links)
- Meyniel's theorem for strongly (<i>p, q</i>) ‐ Hamiltonian digraphs (Q3915018) (← links)
- (Q4000803) (← links)