The Julius Petersen graph theory centennial
著者
書誌事項
The Julius Petersen graph theory centennial
（Topics in discrete mathematics, 6）
North-Holland , Sole distributors for the USA and Canada, Elsevier Science Pub. Co., 1992
- 統一タイトル
-
Discrete mathematics
大学図書館所蔵 件 / 全3件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Contains papers from a conference in honor of Julius Petersen, held in July 1990, in Funen, Denmark
"Reprinted from the journal Discrete mathematics, Volume 100, Numbers 1-3, 1992; Discrete mathematics, Volume 101, Numbers 1-3, 1992."
Includes bibliographical references and indexes
内容説明・目次
内容説明
Julius Petersen's paper, "Die Theorie der regularen graphs" in Acta Mathematica , volume 15 (1891), stands at the beginning of graph theory as we know it today. The Danish group of graph theorists decided in 1985 to mark the 150th birthday of Petersen in 1989, as well as the centennial of his paper. It was felt that the occasion called for a presentation of Petersen's famous paper in its historical context and, in a wider sense, of Petersen's life and work as a whole. However, the readily available information about Julius Petersen amounted to very little (not even a full bibliography existed) and virtually nothing was known about the circumstances that led him to write his famous paper. The study of Petersen's life and work has resulted in several papers, in particular a biography, a bibliography, an annotated edition of the letters surrounding Petersen's paper of 1891, an analysis of Petersen's paper and an annotated edition of parts of Petersen's correspondence with Sylow on Galois theory. The first four of these papers, together with a survey of matching theory, form the first part of this book.
In addition to these five special papers, there are papers submitted in the celebration of the Petersen centennial.
目次
Problems worthy of attack (P. Hein). Julius Petersen Photographs. Julius Petersen 1839-1910, A biography (J. Lutzen, G. Sabidussi, B. Toft). Julius Petersen annotated bibliography (M. Christiansen et al.). Correspondence between Sylvester, Petersen, Hilbert and Klein on invariants and the factorisation of graphs 1889-1891 (G. Sabidussi). Julius Petersen's theory of regular graphs (H.M. Mulder). Matching theory - a sampler: from Denes Konig to the present (M.D. Plummer). We shall have to evolve (P. Hein). On a conjecture of Gallai concerning complete subgraphs of k -critical graphs (H.L. Abbott, B. Zhou). On total covers of graphs (Y. Alavi et al.). Turan theorems with repeated degrees (M.O. Albertson). On the structure of locally semicomplete digraphs (J. Bang-Jensen). Precoloring extension. l. interval graphs (M. Biro, M. Hujter, Z. Tuza). Cyclic coloring of plane graphs (O.V. Borodin). Determinants and current flows in electric networks (R.L. Brooks et al.). The ubiquitous Petersen graph (G. Chartrand, H. Hevia, R.J. Wilson). The end structure of a graph: recent results and open problems (R. Diestel). Coflow polyhedra (K. Cameron, J. Edmonds). Extremal problems involving vertices and edges on odd cycles (P. Erdos, R.J. Faudree, C.C. Rousseau). Spanning Eulerian subgraphs, the Splitting Lemma, and Petersen's Theorem (H. Fleischner). A solution to a colouring problem of P. Erdos (H. Fleischner, M. Stiebitz). On a theorem of Mader (A. Frank). Indecomposable regular graphs and hypergraphs (Z. Furedi). On the r-domination number of a graph (J.R. Griggs, J.P. Hutchinson). Enumeration of regular graphs 100 years ago (H. Gropp). The Cartesian product of a k -extendable and an l-extendable graph is (k + l + 1)-extendable (E. Gyori, M.D. Plummer). Some finiteness results concerning separation in graphs (R. Halin). A quick proof that K 10 #P+P+P (D. Hanson). On cages with given degree sets (D. Hanson, P. Wang, L.K. Jorgensen). On 3-connected graphs with contractible edge covers of size k (R.L. Hemminger, X. Yu). The chromatic index of a graph whose core has maximum degree two (A.J.W. Hilton, Z. Cheng). A new invariant of plane bipartite cubic graphs (F. Jaeger). Colorful induced subgraphs (H.A. Kierstead, W.T. Trotter). An extension of the multi-path algorithm for finding hamilton cycles (W. Kocay). List edge chromatic number of graphs with large girth (A.V. Kostochka). T -colorings of graphs (D.D.-F. Liu). Conjecture de Hadwiger: k =6.II-Reductions de sommets de degre 6 dans les graphes 6-chromatiques contraction-critiques (J. Mayer). On Ramsey graphs without bipartite subgraphs (J. Nesetril, V. Rodl). Plurality preference digraphs realized by trees, II: On realization numbers (K.B. Reid, W. Gu). Binary invariants and orientations of graphs (G. Sabidussi). How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs (H. Sachs). Cycles of length 2 modulo 3 in graphs (A. Saito).
「Nielsen BookData」 より
