The following pages link to Peter Horák (Q215558):
Displayed 50 items.
- On a problem of Marco Buratti (Q1010924) (← links)
- Equitable specialized block-colourings for Steiner triple systems (Q1014819) (← links)
- Further results on overlarge sets of Kirkman triple systems (Q1034267) (← links)
- Further 6-sparse Steiner triple systems (Q1043789) (← links)
- Self-converse large sets of pure Mendelsohn triple systems (Q1044342) (← links)
- On complexity of round transformations (Q1045033) (← links)
- On perfect Lee codes (Q1045037) (← links)
- Some properties of a multidigraph by semi-incidence matrices (Q1058523) (← links)
- Item:Q215558 (redirect page) (← links)
- Path partitions and packs of acyclic digraphs (Q1061135) (← links)
- On a construction of critical graphs which are not sensitive (Q1064327) (← links)
- On certain regular graphs of girth 5 (Q1066159) (← links)
- Graphs with unique maximum independent sets (Q1069954) (← links)
- On the Shannon capacity of a directed graph (Q1074597) (← links)
- On kernel-perfect critical digraphs (Q1076036) (← links)
- Subgraphs intersecting any Hamiltonian cycle (Q1077429) (← links)
- On a construction of Thomassen (Q1087884) (← links)
- On the exponent of a primitive, minimally strong digraph (Q1100474) (← links)
- On a problem of Erdős concerning property B (Q1102961) (← links)
- On the exponents of primitive digraphs with the shortest elementary circuit length s (Q1105617) (← links)
- Scattering number and extremal non-Hamiltonian graphs (Q1109047) (← links)
- Repeated distances in space (Q1109785) (← links)
- Doubly regular asymmetric digraphs (Q1112834) (← links)
- On edge-Hamiltonian property of Cayley graphs (Q1112835) (← links)
- On the maximal index of graphs with a prescribed number of edges (Q1116954) (← links)
- A coloring problem related to the Erdős, Faber, Lovasz conjecture (Q1117945) (← links)
- Periodic digraphs and their properties (Q1121903) (← links)
- A new method to extend kernel-perfect graphs to kernel-perfect critical graphs (Q1121904) (← links)
- A Helly theorem in weakly modular space (Q1126279) (← links)
- Invariant Hamming graphs in infinite quasi-median graphs (Q1126287) (← links)
- Counting acyclic digraphs by sources and sinks (Q1126301) (← links)
- Latin parallelepipeds and cubes (Q1167732) (← links)
- Another proof of a theorem concerning detachments of graphs (Q1176032) (← links)
- Extending partial systems of distinct representatives (Q1179087) (← links)
- Long cycles in subgraphs with prescribed minimum degree (Q1183969) (← links)
- Graphs with small diameter after edge deletion (Q1199416) (← links)
- Characterizations of max-balanced flows (Q1201811) (← links)
- The connectivity of the block-intersection graphs of designs (Q1209216) (← links)
- Minimal oriented graphs of diameter 2 (Q1272532) (← links)
- Finiteness conditions for generalized exponents of digraphs (Q1273106) (← links)
- A combinatorial problem in database security (Q1283790) (← links)
- Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831) (← links)
- The influence of special vertices on strong domination (Q1292872) (← links)
- On connectivity of the cartesian product of two graphs (Q1294201) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- \((k,g)\)-cages are 3-connected (Q1297446) (← links)
- A conjecture concerning strongly connected graphs (Q1301281) (← links)
- 9-connected claw-free graphs are Hamilton-connected (Q1305527) (← links)
- Reverse binary graphs (Q1310229) (← links)
- Large \(s\)-representable set systems with low maximum degree (Q1313861) (← links)