American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(05C35) AND publication=(all)
Sort order: Date
Format: Standard display

  
Results: 31 to 43 of 43 found      Go to page: 1 2

[31] E. Rodney Canfield. On a problem of Rota. Bull. Amer. Math. Soc. 84 (1978) 164. MR 0476535.
Abstract, references, and article information   
View Article: PDF

[32] Nimrod Megiddo. A good algorithm for lexicographically optimal flows in multi-terminal networks. Bull. Amer. Math. Soc. 83 (1977) 407-409. MR 0432205.
Abstract, references, and article information   
View Article: PDF

[33] Nimrod Megiddo. Partial and complete cyclic orders. Bull. Amer. Math. Soc. 82 (1976) 274-276. MR 0404065.
Abstract, references, and article information   
View Article: PDF

[34] D. E. Daykin. Corrigendum and addendum to: ``Pseudo-matchings of a bipartite graph'' (Proc. Amer. Math. Soc. {\bf 42} (1974), 28--32) by Alan Brace and Daykin . Proc. Amer. Math. Soc. 56 (1976) 380-382. MR 0409269.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[35] David Sanders. Metric spaces in which minimal circuits cannot self-intersect . Proc. Amer. Math. Soc. 56 (1976) 383-387. MR 0414425.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[36] E. Dixon and S. Goodman. On the number of Hamiltonian circuits in the $n$-cube . Proc. Amer. Math. Soc. 50 (1975) 500-504. MR 0369157.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[37] Alan Brace and D. E. Daykin. Pseudo-matchings of a bipartite graph . Proc. Amer. Math. Soc. 42 (1974) 28-32. MR 0329960.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[38] Stephen B. Maurer. Basis graphs of pregeometries. Bull. Amer. Math. Soc. 79 (1973) 783-786. MR 0376406.
Abstract, references, and article information   
View Article: PDF

[39] E. M. Wright. For how many edges is a digraph almost certainly Hamiltonian? . Proc. Amer. Math. Soc. 41 (1973) 384-388. MR 0342436.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[40] Václav Chvátal and Frank Harary. Generalized Ramsey theory for graphs. Bull. Amer. Math. Soc. 78 (1972) 423-426. MR 0291016.
Abstract, references, and article information   
View Article: PDF

[41] Václav Chvátal and Frank Harary. Generalized Ramsey theory for graphs. II. Small diagonal numbers . Proc. Amer. Math. Soc. 32 (1972) 389-394. MR 0332559.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[42] Gary Chartrand and Seymour Schuster. On a variation of the Ramsey number . Trans. Amer. Math. Soc. 173 (1972) 353-362. MR 0317992.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[43] Branko Grünbaum. Polytopes, graphs, and complexes. Bull. Amer. Math. Soc. 76 (1970) 1131-1201. MR 0266050.
Abstract, references, and article information   
View Article: PDF


Results: 31 to 43 of 43 found      Go to page: 1 2