Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 11
Volume 11, Number 1, March 1995
- Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin:
The maximal number of inducedr-partite subgraphs. 1-19 - Ralph J. Faudree, Jan van den Heuvel:
Degree sums, k-factors and hamilton cycles in graphs. 21-28 - Luisa Gargano
, János Körner, Ugo Vaccaro:
On the capacity of boolean graph formulæ. 29-48 - Yubao Guo, Lutz Volkmann:
A generalization of menger's theorem for certain block - cactus graphs. 49-52 - Penny E. Haxell:
A note on a conjecture of Gallai. 53-57 - Janice Jeffs, Suzanne M. Seager:
The chip firing game onn-cycles. 59-67 - Appu Muthusamy, P. Paulraja:
Factorizations of product graphs into cycles of uniform length. 69-90 - Daniel P. Sanders, Yue Zhao:
A note on the three color problem. 91-94
Volume 11, Number 2, June 1995
- Darryn E. Bryant, Peter Adams:
Decomposing the complete graph into cycles of many lengths. 97-102 - Laura M. Chihara, Dennis Stanton:
A matrix equation for association schemes. 103-108 - Kiran B. Chilakamarri, Nathaniel Dean:
The Ulam number of infinite graphs. 109-120 - B. Gamble, William R. Pulleyblank, Bruce A. Reed, F. Bruce Shepherd:
Right angle free subsets in the plane. 121-129 - Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Minimum order of loop networks of given degree and girth. 131-138 - K. Nomura:
A remark on bipartite distance-regular graphs of even valency. 139-140 - Haruko Okamura:
2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs. 141-170 - Bruce A. Reed, Najiba Sbihi:
Recognizing bull-free perfect graphs. 171-178 - Alexander F. Sidorenko:
What we know and what we do not know about Turán numbers. 179-199 - Chih-Wen Weng:
Kite-freeP- andQ-polynomial schemes. 201-207
Volume 11, Number 3, September 1995
- Jürgen Bierbrauer:
A new family of 4-designs. 209-211 - Claudson F. Bornstein, Jayme Luiz Szwarcfiter:
On clique convergent graphs. 213-220 - Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Hamiltonicity in balancedk-partite graphs. 221-231 - Hortensia Galeana-Sánchez, Sergio Rajsbaum:
Cycle-pancyclism in tournaments I. 233-243 - Penny E. Haxell:
A condition for matchability in hypergraphs. 245-248 - Ryan B. Hayward:
Discs in unbreakable graphs. 249-254 - George R. T. Hendry, Stephan Brandt:
An extremal problem for cycles in hamiltonian graphs. 255-262 - Leif K. Jørgensen:
Critical 3-cochromatic graphs. 263-266 - Xin Liu:
Independent sets, cliques and hamiltonian graphs. 267-273 - Hideaki Morita:
Cohen-Macaulay types of subgroup lattices of finite abelianp-groups. 275-283 - Yee-Hock Peng:
Another family of chromatically unique graphs. 285-291 - Mika Watanabe:
Some best possible bounds concerning the traces of finite sets II. 293-303
Volume 11, Number 4, December 1995
- Akira Hiraki, Hiroshi Suzuki, Masayuki Wajima:
On distance-regular graphs withki =kj, II. 305-317 - E. Ihrig:
Graphs that admit square 1-factorizations are hamiltonian Cayley graphs. 319-326 - Yoshiyasu Ishigami:
Containment problems in high-dimensional spaces. 327-335 - Jin Xu, Zhenhong Liu:
The chromatic polynomial between graph & its complement - about Akiyama and Hararys' open problem. 337-345 - Rudolf Mathon, Anne Penfold Street:
Partitions of sets of two-fold triple systems, and their relation to some strongly regular graphs. 347-366 - Thomas Niessen:
Minimum degree, independence number and regular factors. 367-378 - Henk Jan Veldman:
Dλ-cycles in 3-cyclable graphs. 379-388 - Hong Wang:
Two vertex-disjoint cycles in a graph. 389-396
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-25 20:50 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:
