05 Combinatorics

Adámek J., Koubek V.: Remarks on flows in network with short paths. 12:4 (1971), pp. 661 -- 667.
Ajtai M., Komlós J., Rödl V., Szemeredi E.: On coverings of random graphs. 23:1 (1982), pp. 193 -- 198.
Berman D.M.: A note on choosability in planar graphs. 23:3 (1982), pp. 537 -- 540.
Blažek J., Koman M.: On an extremal problem concerning graphs. 8:1 (1967), pp. 49 -- 52.
Boguszak M., Poljak S., Tůma J.: Note on homomorphism interpolation theorem. 17:1 (1976), pp. 105 -- 109.
Chvátal V.: On finite and countable rigid graphs and tournaments. 6:4 (1965), pp. 429 -- 438.
Chvátal V.: Remark on a paper of Lovász. 9:1 (1968), pp. 47 -- 50.
Drápal A., Kepka T.: Group distances of Latin squares. 26:2 (1985), pp. 275 -- 283.
Drápal A., Kepka T.: On a distance of groups and latin squares. 30:4 (1989), pp. 621 -- 626.
Dvořáková--Rulićová I.: Perfect codes in regular graphs. 29:1 (1988), pp. 79 -- 83.
Erdös P., Preiss D.: Decomposition of spheres in Hilbert spaces. 17:4 (1976), pp. 791 -- 795.
Fronček D.: On graphs with prescribed edge neighbourhoods. 30:4 (1989), pp. 749 -- 754.
Gavalec M., Vojtáš P.: Remarks to a modification of Ramsey-type theorems. 21:4 (1980), pp. 727 -- 738.
Harary F., Kabell J.A., McMorris F.R.: Bipartite intersection graphs. 23:4 (1982), pp. 739 -- 745.
Havel I., Křivánek M.: On maximal matchings in $Q_6$ and a conjecture of R. Forcade. 23:1 (1982), pp. 123 -- 136.
Havel V., Klouda J.: Skeletons in multigraphs. 34:4 (1993), pp. 689 -- 696.
Hedrlín Z.: On number of commutative mappings from finite set into itself. 3:1 (1962), pp. 32 -- 32.
Hell P.: Rigid undirected graphs with given number of vertices. 9:1 (1968), pp. 51 -- 69.
Ivančo J., Jendro\v{l} S., Tkáč M.: Note on Petrie and Hamiltonian cycles in cubic polyhedral graphs. 35:2 (1994), pp. 413 -- 416.
Jendrol' S., Ryjáček Z.: $3$-polytopes of constant tolerance of edges. 22:4 (1981), pp. 843 -- 850.
Jirásek J.: On a certain class of multidigraphs, for which reversal of no arc decreases the number of their cycles. 28:1 (1987), pp. 185 -- 189.
Klazar M.: A general upper bound in extremal theory of sequences. 33:4 (1992), pp. 737 -- 746.
Klazar M.: Two results on a partial ordering of finite sequences. 34:4 (1993), pp. 697 -- 705.
Koman M.: On nonplanar graphs with the minimum number of vertices and a given girth. 11:1 (1970), pp. 9 -- 17.
Koubek V., Rajlich J.: Regular societies without short cycles. 21:1 (1980), pp. 161 -- 169.
Koubek V., Rödl V.: On number of covering arcs in orderings. 22:4 (1981), pp. 721 -- 733.
Kratochvíl J.: $1$-perfect codes over self-complementary graphs. 26:3 (1985), pp. 589 -- 595.
Kratochvíl J.: Perfect codes and two-graphs. 30:4 (1989), pp. 755 -- 760.
Kratochvíl J., Matoušek J.: NP-hardness results for intersection graphs. 30:4 (1989), pp. 761 -- 773.
Kratochvíľ J., Nešetřil J.: INDEPENDENT SET and CLI\-QUE problems in intersection--defined classes of graphs. 31:1 (1990), pp. 85 -- 93.
Křivka P.: On homomorphism perfect graphs. 12:3 (1971), pp. 619 -- 626.
Kučera A.: Dostatočnyje uslovija normiruemosti linejnych operatorov v konstruktivnoj matematike. 12:2 (1971), pp. 377 -- 399.
Kučera L., Rödl V.: Large trees in random graphs. 28:1 (1987), pp. 7 -- 14.
Lee S.M., Tanoto R.: Three classes of diameter edge-invariant graphs. 28:2 (1987), pp. 227 -- 232.
Lindner C.C., Straley T.H.: A note on nonisomorphic Steiner quadruple systems. 15:1 (1974), pp. 69 -- 74.
Lindner Ch.C.: Construction of quasigroups having a large number of orthogonal mates. 12:3 (1971), pp. 611 -- 617.
Loebl M.: Hercules and Hydra, a game on rooted finite trees. 26:2 (1985), pp. 259 -- 267.
Loebl M.: Hercules and Hydra. 29:1 (1988), pp. 85 -- 95.
Mahrhold K., Weber K.: Planarity thresholds for two types of random subgraphs of the $n$-cube. 30:1 (1989), pp. 71 -- 73.
Majcher Z.: Alternating cycles and realizations of a degree sequence. 28:3 (1987), pp. 467 -- 480.
Matoušek J.: Few colored cuts or cycles in edge colored graphs. 29:2 (1988), pp. 227 -- 232.
Matoušek J.: Ramsey-like properties for bi-Lipschitz mappings of finite metric spaces. 33:3 (1992), pp. 451 -- 463.
Matoušek J., Loebl M.: Hercules versus Hidden Hydra Helper. 32:4 (1991), pp. 731 -- 741.
McMorris F.R., Shier D.R.: Representing chordal graphs on $K_{1,n}$. 24:3 (1983), pp. 489 -- 494.
Müller V.: Probabilistic reconstruction from subgraphs. 17:4 (1976), pp. 709 -- 719.
Müller V., Nešetřil J., Pelant J.: Either tournaments or algebras?. 13:4 (1972), pp. 801 -- 807.
Nebeský L.: Graphic algebras. 11:3 (1970), pp. 533 -- 544.
Nebeský L.: Median graphs. 12:2 (1971), pp. 317 -- 325.
Nebeský L.: Planar permutation graphs of paths. 13:2 (1972), pp. 253 -- 256.
Nebeský L.: A theorem on hamiltonian line graphs. 14:1 (1973), pp. 107 -- 112.
Nebeský L.: A note on line graphs. 15:3 (1974), pp. 567 -- 570.
Nešetřil J.: $K$-chromatičeskije grafy bez ciklov dliny $\leq 7$. 7:3 (1966), pp. 373 -- 376.
Nešetřil J.: Graphs with small asymmetries. 11:3 (1970), pp. 403 -- 419.
Nešetřil J.: On reconstructing of infinite forests. 13:3 (1972), pp. 503 -- 510.
Nešetřil J., Poljak S.: On the complexity of the subgraph problem. 26:2 (1985), pp. 415 -- 419.
Nešetřil J., Rödl V.: Partitions of vertices. 17:1 (1976), pp. 85 -- 95.
Nešetřil J., Rödl V.: Van der Waerden theorem for sequences of integers not containing an arithmetic progression of $k$ terms. 17:4 (1976), pp. 675 -- 681.
Nešetřil J., Rödl V.: On Ramsey graphs without cycles of short odd lengths. 20:3 (1979), pp. 565 -- 582.
Nešetřil J., Rödl V.: Partite construction and Ramseyan theorems for sets, numbers and spaces. 28:3 (1987), pp. 569 -- 580.
Nešetřil J., Thomas R.: A note on spatial representation of graphs. 26:4 (1985), pp. 655 -- 659.
Ninčák J.: On a conjecture by Nash--Williams. 14:1 (1973), pp. 135 -- 138.
Ninčák J.: Hamiltonian circuits in cubic graphs. 15:4 (1974), pp. 627 -- 630.
Novák J.: Uber gewisse minimale Systeme von $k$-Tupeln. 11:3 (1970), pp. 397 -- 402.
Nýdl V.: Finite graphs and digraphs which are not reconstructible from their cardinality restricted subgraphs. 22:2 (1981), pp. 281 -- 287.
Pelant J., Rödl V.: On generating of relations. 14:1 (1973), pp. 95 -- 105.
Poljak S.: Coloring digraphs by iterated antichains. 32:2 (1991), pp. 209 -- 212.
Poljak S., Pultr A.: Representing graphs by means of strong and weak products. 22:3 (1981), pp. 449 -- 466.
Poljak S., Turzík D.: On amalgamation of graphs and essential sets of generators. 19:2 (1978), pp. 359 -- 369.
Poljak S., Turzík D.: On systems, periods and semipositive mappings. 25:4 (1984), pp. 597 -- 614.
Pöschel R., Wessel W.: Classes of graphs definable by graph algebra identities or quasi-identities. 28:3 (1987), pp. 581 -- 592.
Pultr A.: An analogon of the fixed-point theorem and its application for graphs. 4:3 (1963), pp. 121 -- 131.
Pultr A.: Tensor products in the category of graphs. 11:4 (1970), pp. 619 -- 639.
Puš V.: A remark on distances in products of graphs. 28:2 (1987), pp. 233 -- 239.
Puš V.: Chromatic number of products of graphs. 29:3 (1988), pp. 457 -- 463.
Puš V.: Representation of semigroups by products of simple graphs. 30:2 (1989), pp. 227 -- 234.
Rödl V.: On systems of graphs intersecting in paths. 19:1 (1978), pp. 135 -- 140.
Šiška J.: On homotopical equivalence of tolerance spaces. 19:4 (1978), pp. 705 -- 713.
Sysło M.M.: Adjacency matrix equations and related problems: research notes. 24:2 (1983), pp. 211 -- 222.
Thomas R.: Series-parallel graphs and well- and better-quasi-orderings. 25:4 (1984), pp. 719 -- 723.
Tomasta P.: Decompositions of complete $k$-uniform hypergraphs into factors with given diameters. 17:2 (1976), pp. 377 -- 392.
Trnková V.: On products of binary relational structures. 17:3 (1976), pp. 513 -- 521.
Trnková V.: Isomorphisms of products of infinite connected graphs. 25:2 (1984), pp. 303 -- 317.
Trnková V., Koubek V.: Isomorphisms of products of infinite graphs. 19:4 (1978), pp. 639 -- 652.
Turzík D.: A note on chromatic number of direct product of graphs. 24:3 (1983), pp. 461 -- 463.
Voss H.-J.: Graphs with prescribed maximal subgraphs and critical chromatic graphs. 18:1 (1977), pp. 129 -- 142.
Voss H.-J.: Note on a paper of McMorris and Shier. 26:2 (1985), pp. 319 -- 322.
Wichs T.: On minimal semirigid relations. 12:2 (1971), pp. 359 -- 365.
Witzany J.: On balancing of hypergraphs. 28:1 (1987), pp. 15 -- 21.
Zelinka B.: Tolerance graphs. 9:1 (1968), pp. 121 -- 131.