Pančoška, Petr; Janota, Vít; Nešetřil, Jaroslav Novel matrix descriptor for determination of the connectivity of secondary structure segments in proteins. Analysis of general properties using graph theory. (English) Zbl 0973.92015 Discrete Math. 235, No. 1-3, 399-423 (2001). MSC: 92C40 05C90 92D20 PDFBibTeX XMLCite \textit{P. Pančoška} et al., Discrete Math. 235, No. 1--3, 399--423 (2001; Zbl 0973.92015) Full Text: DOI
Nakamigawa, Tomoki Nakade – a graph theoretic concept in Go. (English) Zbl 1028.91009 Discrete Math. 235, No. 1-3, 385-397 (2001). MSC: 91A43 05C90 PDFBibTeX XMLCite \textit{T. Nakamigawa}, Discrete Math. 235, No. 1--3, 385--397 (2001; Zbl 1028.91009) Full Text: DOI
Konstantinova, Elena V.; Skorobogatov, Vladimir A. Application of hypergraph theory in chemistry. (English) Zbl 0977.05133 Discrete Math. 235, No. 1-3, 365-383 (2001). MSC: 05C90 92E10 05C65 PDFBibTeX XMLCite \textit{E. V. Konstantinova} and \textit{V. A. Skorobogatov}, Discrete Math. 235, No. 1--3, 365--383 (2001; Zbl 0977.05133) Full Text: DOI
Amar, D.; Raspaud, A.; Togni, O. All-to-all wavelength-routing in all-optical compound networks. (English) Zbl 0977.05132 Discrete Math. 235, No. 1-3, 353-363 (2001). MSC: 05C90 90B18 68R10 PDFBibTeX XMLCite \textit{D. Amar} et al., Discrete Math. 235, No. 1--3, 353--363 (2001; Zbl 0977.05132) Full Text: DOI
Zelinka, Bohdan Periodicity of graph operators. (English) Zbl 0984.05072 Discrete Math. 235, No. 1-3, 349-351 (2001). Reviewer: Katherine Heinrich (Regina) MSC: 05C99 PDFBibTeX XMLCite \textit{B. Zelinka}, Discrete Math. 235, No. 1--3, 349--351 (2001; Zbl 0984.05072) Full Text: DOI EuDML
Šámal, Robert; Vondrák, Jan The limit checker number of a graph. (English) Zbl 0991.91012 Discrete Math. 235, No. 1-3, 343-347 (2001). MSC: 91A43 05C99 PDFBibTeX XMLCite \textit{R. Šámal} and \textit{J. Vondrák}, Discrete Math. 235, No. 1--3, 343--347 (2001; Zbl 0991.91012) Full Text: DOI
Nýdl, Václav Graph reconstruction from subgraphs. (English) Zbl 0977.05091 Discrete Math. 235, No. 1-3, 335-341 (2001). MSC: 05C60 PDFBibTeX XMLCite \textit{V. Nýdl}, Discrete Math. 235, No. 1--3, 335--341 (2001; Zbl 0977.05091) Full Text: DOI
Nešetřil, J.; Pultr, A. A note on homomorphism-independent families. (English) Zbl 0973.05076 Discrete Math. 235, No. 1-3, 327-334 (2001). Reviewer: U.Knauer (Oldenburg) MSC: 05C99 18A99 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{A. Pultr}, Discrete Math. 235, No. 1--3, 327--334 (2001; Zbl 0973.05076) Full Text: DOI
Nebeský, Ladislav The set of geodesics in a graph. (English) Zbl 1021.05031 Discrete Math. 235, No. 1-3, 323-326 (2001). MSC: 05C12 05C38 PDFBibTeX XMLCite \textit{L. Nebeský}, Discrete Math. 235, No. 1--3, 323--326 (2001; Zbl 1021.05031) Full Text: DOI
Matúš, František Excluded minors for Boolean polymatroids. (English) Zbl 0995.05029 Discrete Math. 235, No. 1-3, 317-321 (2001). Reviewer: Brigitte Servatius (Worcester) MSC: 05B35 PDFBibTeX XMLCite \textit{F. Matúš}, Discrete Math. 235, No. 1--3, 317--321 (2001; Zbl 0995.05029) Full Text: DOI
Körner, J.; Marton, K. Relative capacity and dimension of graphs. (English) Zbl 0977.05066 Discrete Math. 235, No. 1-3, 307-315 (2001). MSC: 05C35 PDFBibTeX XMLCite \textit{J. Körner} and \textit{K. Marton}, Discrete Math. 235, No. 1--3, 307--315 (2001; Zbl 0977.05066) Full Text: DOI
Idzik, Adam; Tuza, Zsolt Heredity properties of connectedness in edge-coloured complete graphs. (English) Zbl 0978.05031 Discrete Math. 235, No. 1-3, 301-306 (2001). MSC: 05C15 05C40 05C35 68R10 05C65 PDFBibTeX XMLCite \textit{A. Idzik} and \textit{Z. Tuza}, Discrete Math. 235, No. 1--3, 301--306 (2001; Zbl 0978.05031) Full Text: DOI
Tomescu, Ioan On the number of graphs and \(h\)-hypergraphs with bounded diameter. (English) Zbl 0979.05060 Discrete Math. 235, No. 1-3, 291-299 (2001). Reviewer: Edgar M.Palmer (East Lansing) MSC: 05C30 05C65 05C12 PDFBibTeX XMLCite \textit{I. Tomescu}, Discrete Math. 235, No. 1--3, 291--299 (2001; Zbl 0979.05060) Full Text: DOI
Nagle, Brendan; Rödl, Vojtěch The asymptotic number of triple systems not containing a fixed one. (English) Zbl 0977.05018 Discrete Math. 235, No. 1-3, 271-290 (2001). MSC: 05B07 05C65 05D05 05A16 PDFBibTeX XMLCite \textit{B. Nagle} and \textit{V. Rödl}, Discrete Math. 235, No. 1--3, 271--290 (2001; Zbl 0977.05018) Full Text: DOI
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre Proof of the Alon-Yuster conjecture. (English) Zbl 0977.05106 Discrete Math. 235, No. 1-3, 255-269 (2001). Reviewer: Lutz Volkmann (Aachen) MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{J. Komlós} et al., Discrete Math. 235, No. 1--3, 255--269 (2001; Zbl 0977.05106) Full Text: DOI
Díaz, Josep; Petit, Jordi; Serna, María; Trevisan, Luca Approximating layout problems on random graphs. (English) Zbl 0977.05128 Discrete Math. 235, No. 1-3, 245-253 (2001). MSC: 05C80 60C05 68R10 PDFBibTeX XMLCite \textit{J. Díaz} et al., Discrete Math. 235, No. 1--3, 245--253 (2001; Zbl 0977.05128) Full Text: DOI
Stevanović, Dragan Hosoya polynomial of composite graphs. (English) Zbl 0973.05026 Discrete Math. 235, No. 1-3, 237-244 (2001). Reviewer: Ján Plesník (Bratislava) MSC: 05C12 PDFBibTeX XMLCite \textit{D. Stevanović}, Discrete Math. 235, No. 1--3, 237--244 (2001; Zbl 0973.05026) Full Text: DOI
Fiedler, Miroslav A numerical approach to long cycles in graphs and digraphs. (English) Zbl 0977.05071 Discrete Math. 235, No. 1-3, 233-236 (2001). MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{M. Fiedler}, Discrete Math. 235, No. 1--3, 233--236 (2001; Zbl 0977.05071) Full Text: DOI
Evdokimov, Sergei; Ponomarenko, Ilia Two-closure of odd permutation group in polynomial time. (English) Zbl 0982.20005 Discrete Math. 235, No. 1-3, 221-232 (2001). Reviewer: Alexander Hulpke (Columbus) MSC: 20B40 PDFBibTeX XMLCite \textit{S. Evdokimov} and \textit{I. Ponomarenko}, Discrete Math. 235, No. 1--3, 221--232 (2001; Zbl 0982.20005) Full Text: DOI
Era, Hiroshi; Ogawa, Kenjiro; Tsuchiya, Morimasa On transformations of posets which have the same bound graph. (English) Zbl 0977.05113 Discrete Math. 235, No. 1-3, 215-220 (2001). MSC: 05C75 06A07 PDFBibTeX XMLCite \textit{H. Era} et al., Discrete Math. 235, No. 1--3, 215--220 (2001; Zbl 0977.05113) Full Text: DOI
Eliahou, Shalom; Kervaire, Michel Restricted sums of cardinality \(1+p\) in a vector space over \(\mathbb{F}_p\). (English) Zbl 1006.11005 Discrete Math. 235, No. 1-3, 199-213 (2001). Reviewer: Tara Smith (Cincinnati) MSC: 11B75 PDFBibTeX XMLCite \textit{S. Eliahou} and \textit{M. Kervaire}, Discrete Math. 235, No. 1--3, 199--213 (2001; Zbl 1006.11005) Full Text: DOI
Drápal, Aleš Hamming distances of groups and quasi-groups. (English) Zbl 0986.20065 Discrete Math. 235, No. 1-3, 189-197 (2001). Reviewer: I.Corovei (Cluj-Napoca) MSC: 20N05 20N02 05B15 52B45 PDFBibTeX XMLCite \textit{A. Drápal}, Discrete Math. 235, No. 1--3, 189--197 (2001; Zbl 0986.20065) Full Text: DOI
Leck, Uwe Optimal shadows and ideals in submatrix orders. (English) Zbl 0986.06002 Discrete Math. 235, No. 1-3, 173-187 (2001). Reviewer: Joseph Neggers (Tuscaloosa) MSC: 06A07 05D05 06A05 PDFBibTeX XMLCite \textit{U. Leck}, Discrete Math. 235, No. 1--3, 173--187 (2001; Zbl 0986.06002) Full Text: DOI
Laywine, Charles F. A derivation of an affine plane of order 4 from a triangle-free 3-colored \(K_{16}\). (English) Zbl 0983.05035 Discrete Math. 235, No. 1-3, 165-171 (2001). Reviewer: Ralph G.Stanton (Winnipeg) MSC: 05C15 PDFBibTeX XMLCite \textit{C. F. Laywine}, Discrete Math. 235, No. 1--3, 165--171 (2001; Zbl 0983.05035) Full Text: DOI
Gorgol, Izolda A note on a triangle-free – complete graph induced Ramsey number. (English) Zbl 0978.05053 Discrete Math. 235, No. 1-3, 159-163 (2001). MSC: 05C55 PDFBibTeX XMLCite \textit{I. Gorgol}, Discrete Math. 235, No. 1--3, 159--163 (2001; Zbl 0978.05053) Full Text: DOI
Gravier, Sylvain; Mollard, Michel; Payan, Charles On the nonexistence of three-dimensional tiling in the Lee metric. II. (English) Zbl 0991.52004 Discrete Math. 235, No. 1-3, 151-157 (2001). MSC: 52C22 05B45 05B50 PDFBibTeX XMLCite \textit{S. Gravier} et al., Discrete Math. 235, No. 1--3, 151--157 (2001; Zbl 0991.52004) Full Text: DOI
Bey, C. An intersection theorem for weighted sets. (English) Zbl 1016.05068 Discrete Math. 235, No. 1-3, 145-150 (2001). Reviewer: Konrad Engel (Rostock) MSC: 05D05 PDFBibTeX XMLCite \textit{C. Bey}, Discrete Math. 235, No. 1--3, 145--150 (2001; Zbl 1016.05068) Full Text: DOI
Babilon, Robert 3-colourability of Penrose kite-and-dart tilings. (English) Zbl 0980.52011 Discrete Math. 235, No. 1-3, 137-143 (2001). MSC: 52C23 PDFBibTeX XMLCite \textit{R. Babilon}, Discrete Math. 235, No. 1--3, 137--143 (2001; Zbl 0980.52011) Full Text: DOI
Wang, P.; Dueck, G. W.; MacMillan, S. Using simulated annealing to construct extremal graphs. (English) Zbl 0977.05131 Discrete Math. 235, No. 1-3, 125-135 (2001). MSC: 05C85 05C35 05C07 90C59 PDFBibTeX XMLCite \textit{P. Wang} et al., Discrete Math. 235, No. 1--3, 125--135 (2001; Zbl 0977.05131) Full Text: DOI
Roussel, F.; Rusu, I. An \(O(n^2)\) algorithm to color Meyniel graphs. (English) Zbl 0978.05033 Discrete Math. 235, No. 1-3, 107-123 (2001). MSC: 05C15 05C17 05C38 68R10 PDFBibTeX XMLCite \textit{F. Roussel} and \textit{I. Rusu}, Discrete Math. 235, No. 1--3, 107--123 (2001; Zbl 0978.05033) Full Text: DOI
Hliněný, Petr Contact graphs of line segments are NP-complete. (English) Zbl 0982.05083 Discrete Math. 235, No. 1-3, 95-106 (2001). Reviewer: Van Bang Le (Rostock) MSC: 05C75 68R10 PDFBibTeX XMLCite \textit{P. Hliněný}, Discrete Math. 235, No. 1--3, 95--106 (2001; Zbl 0982.05083) Full Text: DOI
Fiala, Jiří Computational complexity of covering cyclic graphs. (English) Zbl 0977.68045 Discrete Math. 235, No. 1-3, 87-94 (2001). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{J. Fiala}, Discrete Math. 235, No. 1--3, 87--94 (2001; Zbl 0977.68045) Full Text: DOI
Caramia, Massimiliano; Dell’Olmo, Paolo A lower bound on the chromatic number of Mycielski graphs. (English) Zbl 0973.05033 Discrete Math. 235, No. 1-3, 79-86 (2001). Reviewer: Václav Koubek (Praha) MSC: 05C15 68M20 PDFBibTeX XMLCite \textit{M. Caramia} and \textit{P. Dell'Olmo}, Discrete Math. 235, No. 1--3, 79--86 (2001; Zbl 0973.05033) Full Text: DOI
Cameron, Kathie Thomason’s algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk’s graphs. (English) Zbl 0974.05050 Discrete Math. 235, No. 1-3, 69-77 (2001). Reviewer: Lutz Volkmann (Aachen) MSC: 05C45 PDFBibTeX XMLCite \textit{K. Cameron}, Discrete Math. 235, No. 1--3, 69--77 (2001; Zbl 0974.05050) Full Text: DOI
Bylka, S. Local improving algorithms for large cuts in graphs with maximum degree three. (English) Zbl 0977.05130 Discrete Math. 235, No. 1-3, 53-67 (2001). MSC: 05C85 90B05 05C35 68R10 PDFBibTeX XMLCite \textit{S. Bylka}, Discrete Math. 235, No. 1--3, 53--67 (2001; Zbl 0977.05130) Full Text: DOI
Babel, Luitpold; Kloks, Ton; Kratochvil, Jan; Kratsch, Dieter; Müller, Haiko; Olariu, Stephan Efficient algorithms for graphs with few \(P_4\)’s. (English) Zbl 0980.05045 Discrete Math. 235, No. 1-3, 29-51 (2001). Reviewer: Zhi-Hong Chen (Indianapolis) MSC: 05C85 05C70 05C69 05C15 68R10 PDFBibTeX XMLCite \textit{L. Babel} et al., Discrete Math. 235, No. 1--3, 29--51 (2001; Zbl 0980.05045) Full Text: DOI
Àlvarez, C.; Díaz, J.; Serna, M. The hardness of intervalizing four colored caterpillars. (English) Zbl 0977.05055 Discrete Math. 235, No. 1-3, 19-27 (2001). MSC: 05C15 92D20 05C85 68M20 68Q25 PDFBibTeX XMLCite \textit{C. Àlvarez} et al., Discrete Math. 235, No. 1--3, 19--27 (2001; Zbl 0977.05055) Full Text: DOI
Korte, Bernhard; Nešetřil, Jaroslav Vojtěch Jarník’s work in combinatorial optimization. (English) Zbl 1024.01018 Discrete Math. 235, No. 1-3, 1-17 (2001). MSC: 01A70 90-03 01A60 PDFBibTeX XMLCite \textit{B. Korte} and \textit{J. Nešetřil}, Discrete Math. 235, No. 1--3, 1--17 (2001; Zbl 1024.01018) Full Text: DOI
Fiedler, M. (ed.); Kratochvíl, J. (ed.); Nešetřil, J. (ed.) Combinatorics. Proceedings of the 5th Czech and Slovak symposium on combinatorics, graph theory, algorithms and applications, Prague, Czech Republic, July 6–11, 1998. (English) Zbl 0973.00038 Discrete Math. 235, No. 1-3, 426 p. (2001). MSC: 00B25 05-06 PDFBibTeX XMLCite \textit{M. Fiedler} (ed.) et al., Discrete Math. 235, No. 1--3, 426 p. (2001; Zbl 0973.00038) Full Text: DOI