Author(s): J. Akiyama, Y. Egawa and H. Enomoto (Eds.)
Series: Annals of Discrete Mathematics 38
Publisher: North Holland
Year: 1988
Language: English
Pages: iii-iv, 1-418
Content:
General Editor
Page iii
Edited by
Page iii
Copyright page
Page iv
Preface
Pages 1-2
Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto
Highly Irregular m-Chromatic Graphs Original Research Article
Pages 3-13
Yousef Alavi, Fred Buckley, Marc Shamula, Sergio Ruiz
Explicit Construction of Linear Sized Tolerant Networks Original Research Article
Pages 15-19
N. Alon, F.R.K. Chung
Sorting in Rounds Original Research Article
Pages 21-28
Béala Bollobáas
On Edge-Hamiltonian Property of Cayley Graphs Original Research Article
Pages 29-33
C.C. Chen
Gallai Theorems for Graphs, Hypergraphs, and Set Systems Original Research Article
Pages 35-47
E.J. Cockayne, S.T. Hedetniemi, R. Laskar
Edge-Packings of Graphs and Network Reliability Original Research Article
Pages 49-61
Charles J. Colbourn
Two Hamilton Cycles in Bipartite Reflective Kneser Graphs Original Research Article
Pages 63-70
I.J. Dejter, J. Cordova, J.A. Quintana
A Result on Generalized Latin Rectangles Original Research Article
Pages 71-80
Chai-Ling Deng, Chong-Keang Lim
Problems and Results in Combinatorial Analysis and Graph Theory Original Research Article
Pages 81-92
Paul Erdöus
Clique Partitions and Clique Coverings Original Research Article
Pages 93-101
Paul Erdös, Ralph Faudree, Edward T. Ordman
Extremal Theory and Bipartite Graph-Tree Ramsey Numbers Original Research Article
Pages 103-112
P. Erdös, R.J. Faudree, C.C. Rousseau, R.H. Schelp
On Conjectures of Graffiti Original Research Article
Pages 113-118
Siemion Fajtlowicz
Small Order Graph-Tree Ramsey Numbers Original Research Article
Pages 119-127
R.J. Faudree, C.C. Rousseau, R.H. Schelp
Enumerating Phylogenetic Trees with Multiple Labels Original Research Article
Pages 129-139
L.R. Foulds, R.W. Robinson
Triad Count Statistics Original Research Article
Pages 141-149
Ove Frank
Score Sequences: Lexicographic Enumeration and Tournament Construction Original Research Article
Pages 151-155
S.V. Gervacio
Problems on Chain Partitions Original Research Article
Pages 157-162
Jerrold R. Griggs
A Solution to the Misére Shannon Switching Game Original Research Article
Pages 163-166
Yahya Ould Hamidoune, Michel Las Vergnas
A Graph-Theoretical Characterization of the Order Complexes on the 2-Sphere Original Research Article
Pages 167-174
Takayuki Hibi, Hiroshi Narushima, Morimasa Tsuchiya, Kei-Ichi Watanabe
Hard Graphs for the Maximum Clique Problem Original Research Article
Pages 175-179
Cornells Hoede
Doubly Regular Asymmetric Digraphs Original Research Article
Pages 181-185
Noboru Ito
Ordering of the Elements of a Matroid Such that its Consecutive w Elements are Independent Original Research Article
Pages 187-194
Yoji Kajitani, Shuichi Ueno, Hiroshi Miyano
An Existential Problem of a Weightcontrolled Subset and its Application to School Timetable Construction Original Research Article
Pages 195-211
Fumio Kitagawa, Hideto Ikeda
More Non-Reconstructible Hypergraphs Original Research Article
Pages 213-224
W.L. Kocay, Zeke Ming Lui
Constructions of Sensitive Graphs Which are not Strongly Sensitive Original Research Article
Pages 225-236
K.M. Koh, K.S. Poh
Combinatorial Resolution of Systems of Differential Equations. IV. Separation of Variables Original Research Article
Pages 237-250
Pierre Leroux, Gérard X. Viennot
Labeling Angles of Planar Graphs Original Research Article
Pages 251-256
Feodor Loupekine, John J. Watkins
Maximal Induced Trees in Sparse Random Graphs Original Research Article
Pages 257-265
Tomasz Łuczak, Zbigniew Palka
Generalizations of Critical Connectivity of Graphs Original Research Article
Pages 267-283
W. Mader
On the Euclidean Dimension of a Complete Multipartite Graph Original Research Article
Pages 285-289
Hiroshi Maehara
Computation of Some Cayley Diagrams Original Research Article
Pages 291-293
Izumi Miyamoto
Short Cycles in Digraphs Original Research Article
Pages 295-298
Tsuyoshi Nishimura
Subgraph Counts in Random Graphs Using Incomplete U-statistics methods Original Research Article
Pages 299-310
Krzysztof Nowicki, John C. Wierman
Toughness and Matching Extension in Graphs Original Research Article
Pages 311-320
M.D. Plummer
Bipartite Graphs Obtained from Adjacency Matrices of Orientations of Graphs Original Research Article
Pages 321-330
K.B. Reid
Cn-Factors of Group Graphs Original Research Article
Pages 331-336
Mari-Jo P. Ruiz
An Algorithm for Solving the Jump Number Problem Original Research Article
Pages 337-346
Maciej M. Sysło
Large Scale Network Analysis with Applications to Transportation, Communication and Inference Networks Original Research Article
Pages 347-353
Hoon Heng Teh, Meng Fang Foo
On the Nonseparating Independent Set Problem and Feedback Set Problem for Graphs with no Vertex Degree Exceeding Three Original Research Article
Pages 355-360
Shuichi Ueno, Yoji Kajitani, Shin'ya Gotoh
P3-Factorization of Complete Bipartite Graphs Original Research Article
Pages 361-366
Kazuhiko Ushio
n-Graphs Original Research Article
Pages 367-380
Andrew Vince
On Point-Linear Arboricity of Planar Graphs Original Research Article
Pages 381-384
Wang Jianfang
On the Littlewood-Richardson Rule in Terms of Lattice Path Combinatorics Original Research Article
Pages 385-390
Toshihiro Watanabe
Chromatic Polynomials of Generalized Trees Original Research Article
Pages 391-393
Earl Glen Whitehead Jr.
Packing of Graphs-A Survey Original Research Article
Pages 395-404
H.P. Yap
Z-Transformation Graphs of Perfect Matchings of Hexagonal Systems Original Research Article
Pages 405-415
Zhang Fu-Ji, Guo Xiao-Feng, Chen Rong-Si
Author Index
Pages 417-418
