Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 10
Volume 10, Number 1, March 1994
- Martin Aigner, Eberhard Triesch:
Codings of graphs with binary edge labels. 1-10 - Noga Alon:
Packing of partial designs. 11-18 - R. Balakrishnan, R. Sampathkumar:
Decompositions of complete graphs into isomorphic bipartite subgraphs. 19-25 - Boliong Chen, Makoto Matsumoto, Jianfang Wang, Zhongfu Zhang, Jianxun Zhang:
A short proof of Nash-Williams' theorem for the arboricity of a graph. 27-28 - Andreas Huck:
Independent trees in graphs. 29-45 - Noboru Ito, Takeo Okamoto:
Note on Hadamard tournaments of Szekeres type. 47-51 - Midori Kobayashi, Gisaku Nakamura:
On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs. 53-59 - Hiroshi Zuzuki:
On distance-biregular graphs of girth divisible by four. 61-65 - Ngo Dac Tan
:
Hamilton cycles in cubic (m, n)-metacirculant graphs withm divisible by 4. 67-73 - Margaret L. Weaver, Douglas B. West:
Relaxed chromatic numbers of graphs. 75-93
Volume 10, Numbers 2-4, June 1994
- Ciping Chen:
Toughness of Graphs and [2, b ]-Factors. 97-100 - Charles Delorme, Yahya Ould Hamidoune:
On products of sets in groups. 101-104 - Anna Galluccio, Luisa Gargano, János Körner, Gábor Simonyi:
Different capacities of a digraph. 105-121 - Zhicheng Gao, Nicholas C. Wormald:
Spanning eulerian subgraphs of bounded degree in triangulations. 123-131 - Takayuki Hibi:
Cohen-Macaulay type of the face poset of a plane graph. 133-138 - K. Kayathri:
On the size of Edge-Chromatic critical graphs. 139-144 - Emanuel Knill:
Families of sets with locally bounded width. 145-157 - Jan Kratochvíl, Zsolt Tuza:
Intersection Dimensions of Graph Classes. 159-168 - Mingchu Li:
Two edge-disjoint hamiltonian cycles in graphs. 169-178 - Frédéric Maffray, Myriam Preissmann:
Perfect graphs with no P 5 and no K 5. 179-184 - Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Ken-ichi Shinoda:
On automorphism groups of some PCS graphs. 185-191 - Van Bang Le, Erich Prisner:
Iteratedk-line graphs. 193-203 - András Recski:
Elementary strong maps of graphic matroids, II. 205-206 - K. T. Arasu, Dieter Jungnickel, Alexander Pott:
Erratum. 207 - Jayaram Bhasker, Tariq Samad, Douglas B. West:
Size, chromatic number, and connectivity. 209-213 - Charles J. Colbourn, Eric Mendelsohn, Alexander Rosa, Jozef Sirán:
Anti-mitre steiner triple systems. 215-224 - Gregory Z. Gutin:
Minimizing and maximizing the diameter in orientations of graphs. 225-230 - Matús Harminc, Jaroslav Ivanco:
Note on eccentricities in tournaments. 231-234 - Tayuan Huang:
Spectral Characterization of Odd Graphs Ok, k ≤ 6. 235-240 - Shiow-Fen Hwang, Gerard J. Chang:
Edge domatic numbers of complete n- partite graphs. 241-248 - Hong-Jian Lai:
Every 4-Connected Line Graph of a Planar Graph is Hamiltonian. 249-253 - Michel Deza, Hiroshi Maehara:
A few applications of negative- type inequalities. 255-262 - Frédéric Maire:
Slightly triangulated graphs are perfect. 263-268 - K. S. Parvathy, Ambat Remadevi, Ambat Vijayakumar:
About a conjecture on the centers of chordal graphs. 269-270 - Hong Wang:
Independent cycles with limited size in a graph. 271-281 - M. Watanabe, Peter Frankl:
Some best possible bounds concerning the traces of finite sets. 283-292 - Qing Xiang:
Some results on multipliers and numerical multiplier groups of difference sets. 293-304 - S. Arumugam, C. Pakkiam:
Graphoidal bipartite graphs. 305-310 - Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
Protecting convex sets. 311-321 - Guoli Ding:
Recognizing the P4-structure of a tree. 323-328 - Hortensia Galeana-Sánchez, Victor Neumann-Lara:
New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs. 329-336 - Alexander K. Kelmans:
On Edge Semi-Isomorphisms and Semi-Dualities of Graphs. 337-352 - Jenö Lehel:
Neighbourhood-Perfect Line Graphs. 353-361 - Victor Neumann-Lara:
A Short Proof of a Theorem of Reid and Parker on Tournaments. 363-366 - Adolfo Sánchez-Flores:
On Tournaments and Their Largest Transitive Subtournaments. 367-376 - Conrad Johann Swanepoel, Lourens M. Pretorius:
Upper Bounds for a Ramsey Theorem for Trees. 377-382 - Gurusamy Rengasamy Vijayakumar:
Representation of Signed Graphs by Root System E8. 383-388 - Igor E. Zverovich, Vadim E. Zverovich:
Disproof of a Conjecture in the Domination Theory. 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-22 20:02 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:
