Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 72
Volume 72, Numbers 1-3, December 1988
- Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto:
Preface. 1-2 - Yousef Alavi, Fred Buckley, Marc Shamula, Sergio Ruiz:
Highly irregular m-chromatic graphs. 3-13 - Noga Alon, Fan R. K. Chung:
Explicit construction of linear sized tolerant networks. 15-19 - Béla Bollobás:
Sorting in rounds. 21-28 - C. C. Chen:
On edge-Hamiltonian property of Cayley graphs. 29-33 - Ernest J. Cockayne, Stephen T. Hedetniemi, Renu C. Laskar:
Gallai theorems for graphs, hypergraphs, and set systems. 35-47 - Charles J. Colbourn:
Edge-packing of graphs and network reliability. 49-61 - Italo J. Dejter
, J. Cordova, J. A. Quintana:
Two hamilton cycles in bipartite reflective kneser graphs. 63-70 - Chai-Ling Deng, Chong-Keang Lim:
A result on generalized latin rectangles. 71-80 - Paul Erdös:
Problems and results in combinatorial analysis and graph theory. 81-92 - Paul Erdös, Ralph J. Faudree, Edward T. Ordman:
Clique partitions and clique coverings. 93-101 - Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Extremal theory and bipartite graph-tree Ramsey numbers. 103-112 - Siemion Fajtlowicz:
On conjectures of Graffiti. 113-118 - Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Small order graph-tree Ramsey numbers. 119-127 - Les R. Foulds, Robert W. Robinson:
Enumerating phylogenetic trees with multiple labels. 129-139 - Ove Frank:
Triad count statistics. 141-149 - Severino Villanueva Gervacio:
Score sequences: Lexicographic enumeration and tournament construction. 151-155 - Jerrold R. Griggs:
Problems on chain partitions. 157-162 - Yahya Ould Hamidoune, Michel Las Vergnas:
A solution to the Misère Shannon switching Game. 163-166 - Takayuki Hibi, Hiroshi Narushima, Morimasa Tsuchiya, Kei-ichi Watanabe:
A graph-theoretical characterization of the order complexes on the 2-sphere. 167-174 - Cornelis Hoede:
Hard graphs for the maximum clique problem. 175-179 - Noboru Ito:
Doubly regular asymmetric digraphs. 181-185 - Yoji Kajitani, Shuichi Ueno, Hiroshi Miyano:
Ordering of the elements of a matroid such that its consecutive w elements are independent. 187-194 - Fumio Kitagawa, Hideto Ikeda:
An existential problem of a weight- controlled subset and its application to school timetable construction. 195-211 - William L. Kocay, Zeke Ming Lui:
More non-reconstructible hypergraphs. 213-224 - Khee Meng Koh, K. S. Poh:
Constructions of sensitive graphs which are not strongly sensitive. 225-236 - Pierre Leroux, Xavier Gérard Viennot:
Combinatorial resolution of systems of differential equations. IV. separation of variables. 237-250 - Feodor Loupekine, John J. Watkins:
Labeling angles of planar graphs. 251-256 - Tomasz Luczak, Zbigniew Palka:
Maximal induced trees in sparse random graphs. 257-265 - Wolfgang Mader:
Generalizations of critical connectivity of graphs. 267-283 - Hiroshi Maehara:
On the euclidean dimension of a complete multipartite graph. 285-289 - Izumi Miyamoto:
Computation of some Cayley diagrams. 291-293 - Tsuyoshi Nishimura:
Short cycles in digraphs. 295-298 - Krzysztof Nowicki, John C. Wierman:
Subgraph counts in random graphs using incomplete u-statistics methods. 299-310 - Michael D. Plummer:
Toughness and matching extension in graphs. 311-320 - K. B. Reid:
Bipartite graphs obtained from adjacency matrices of orientations of graphs. 321-330 - Mari-Jo P. Ruiz:
Cn-factors of group graphs. 331-336 - Maciej M. Syslo:
An algorithm for solving the jump number problem. 337-346 - Hoon heng Teh, Meng Fang Foo:
Large scale network analysis with applications to transportation, communication and inference networks. 347-353 - Shuichi Ueno, Yoji Kajitani, Shin'ya Gotoh:
On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. 355-360 - Kazuhiko Ushio:
P3-Factorization of complete bipartite graphs. 361-366 - Andrew Vince:
n-Graphs. 367-380 - Jianfang Wang:
On point-linear arboricity of planar graphs. 381-384 - Toshihiro Watanabe:
On the Littlewood-Richardson rule in terms of lattice path combinatorics. 385-390 - Earl Glen Whitehead Jr.:
Chromatic polynomials of generalized trees. 391-393 - H. P. Yap:
Packing of graphs - a survey. 395-404 - Fuji Zhang, Xiaofeng Guo, Rong-si Chen:
Z-transformation graphs of perfect matchings of hexagonal systems. 405-415
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
