The following pages link to Peter Horák (Q215558):
Displayed 50 items.
- Judicious partitions of graphs (Q1314903) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- Fractional domination of strong direct products (Q1324692) (← links)
- A construction of 3-connected graphs (Q1327517) (← links)
- An extension of the Erdős-Stone theorem (Q1340136) (← links)
- Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs (Q1340140) (← links)
- Greedy maximum-clique decompositions (Q1340141) (← links)
- On a matrix partition conjecture (Q1345880) (← links)
- On the jumping constant conjecture for multigraphs (Q1345881) (← links)
- Item:Q215558 (redirect page) (← links)
- Kirkman's school projects (Q1356458) (← links)
- \(2m\)-cycle systems of \(K_{2m+1}\backslash C_m\) (Q1376058) (← links)
- Kernels in a special class of digraphs (Q1377857) (← links)
- Super-connectivity and super-edge-connectivity for some interconnection networks (Q1406242) (← links)
- Completing partial Latin squares with two cyclically generated prescribed diagonals (Q1406746) (← links)
- \(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs. (Q1407835) (← links)
- On Kirkman packing designs KPD\((\{3,4\},v)\). (Q1428517) (← links)
- Coloured permutations containing and avoiding certain patterns (Q1430526) (← links)
- The train marshalling problem (Q1570821) (← links)
- A lower bound on the number of hamiltonian cycles (Q1579572) (← links)
- On conditional edge-connectivity of graphs (Q1594865) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- Hamiltonicity, minimum degree and leaf number (Q1677599) (← links)
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs (Q1759841) (← links)
- Irregular labelings of circulant graphs (Q1761466) (← links)
- Equitable list coloring of graphs (Q1771536) (← links)
- Integer sets with prescribed pairwise differences being distinct (Q1775027) (← links)
- Neighborhood union of independent sets and Hamiltonicity of claw-free graphs (Q1775286) (← links)
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs (Q1775898) (← links)
- Frame self-orthogonal Mendelsohn triple systems (Q1780305) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- Minimum graphs of specified diameter, connectivity and valence. II (Q1812779) (← links)
- Traces of antichains (Q1812791) (← links)
- On the number of distinct minimal clique partitions and clique covers of a line graph (Q1813995) (← links)
- A construction of thickness-minimal graphs (Q1820166) (← links)
- Ranking the vertices of an r-partite paired comparison digraph (Q1821792) (← links)
- Totally symmetric Latin squares with prescribed intersection numbers (Q1827738) (← links)
- Natural bounded concentrators (Q1842573) (← links)
- Determination of the star valency of a graph (Q1861579) (← links)
- The S\(^2\)NS digraphs and the cycle linear system of a digraph (Q1862950) (← links)
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations (Q1865264) (← links)
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors (Q1876686) (← links)
- On non-polynomial Latin squares (Q1877356) (← links)
- A smallest irregular oriented graph containing a given diregular one (Q1883255) (← links)
- Cycle lengths and chromatic number of graphs (Q1883263) (← links)
- Configurations in 4-cycle systems (Q1889824) (← links)
- The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1 (Q1889826) (← links)
- On the edge distribution in triangle-free graphs (Q1892845) (← links)
- On the exponents of primitive, ministrong digraphs with shortest elementary circuit length \(s\) (Q1894467) (← links)
- Integral bases and \(p\)-twisted digraphs (Q1896335) (← links)