default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 18
Volume 18, Number 2, March 1994
- A. J. H. King, Crispin St. John Alvah Nash-Williams:
Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph. 109-117 - Henry A. Kierstead, Stephen G. Penrice:
Radius two trees specify χ-bounded classes. 119-129 - Genghua Fan:
Short cycle covers of cubic graphs. 131-141 - Arie Bialostocki, P. Dierker:
On zero sum Ramsey numbers: Multiple copies of a graph. 143-151 - Cheng Zhao:
Smallest (1, 2)-eulerian weight and shortest cycle covering. 153-160 - Hong Wang:
Path factors of bipartite graphs. 161-167 - Irith Ben-Arroyo Hartman, Fathi Saleh, Daniel Hershkowitz:
On greene's theorem for digraphs. 169-175 - Bolian Liu, Qiaoliang Li:
On a conjecture about the generalized exponent of primitive matrices. 177-179 - Madhav P. Desai, Vasant B. Rao:
A characterization of the smallest eigenvalue of a graph. 181-194 - Jiuqiang Liu:
Constraints on the number of maximal independent sets in graphs. 195-204 - Ilia Krasikov, Yehuda Roditty:
Bounds for the harmonious chromatic number of a graph. 205-209 - Stephen J. Curran:
Disjoint circuits in the cartesian product of two directed cycles. 211-216
Volume 18, Number 3, May 1994
- Ilia Krasikov:
Applications of balance equations to vertex switching reconstruction. 217-225 - Hong-Jian Lai, Cun-Quan Zhang:
Edge-maximal (k, i)-graphs. 227-240 - Douglas Bauer, Edward F. Schmeichel:
Toughness, minimum degree, and the existence of 2-factors. 241-256 - Keith Edwards, Colin McDiarmid:
New upper bounds on harmonious colorings. 257-267 - Yubao Guo, Lutz Volkmann:
Connectivity properties of locally semicomplete digraphs. 269-280 - Nadimpalli V. R. Mahadev, Uri N. Peled, Feng Sun:
Equistable graphs. 281-299 - Erich Prisner
:
A common generalization of line graphs and clique graphs. 301-313 - Yousef Alavi, Jiuqiang Liu, Jianfang Wang:
On linear vertex-arboricity of complementary graphs. 315-322
Volume 18, Number 4, July 1994
- Carsten Thomassen, Edward R. Scheinerman:
Editorial. 323
- Denis Hanson, Ping Wang, Gary MacGillivray:
A note on minimum graphs with girth pair (4, 2l + 1). 325-327 - Ioan Tomescu:
Maximum chromatic polynomials of 2-connected graphs. 329-336 - Gregory L. Cherlin, Péter Komjáth:
There is no universal countable pentagon-free graph. 337-341 - Noga Alon:
Subdivided graphs have linear ramsey numbers. 343-347 - Shinsaku Fujita:
Unit subduced cycle indices for combinatorial enumeration. 349-371 - H. L. Abbott, Bing Zhou, Donovan R. Hare:
Sparse color-critical graphs and hypergraphs with no short cycles. 373-388 - R. A. Clapsadle, Richard H. Schelp:
Local edge colorings that are global. 389-399 - Xingxing Yu:
3-connected graphs with non-cut contractible edge covers of size k. 401-411 - Andreas Huck, Frank Niedermeyer, Saharon Shelah:
Large k-preserving sets in infinite graphs. 413-426 - Sean McGuinness:
The greedy clique decomposition of a graph. 427-430
Volume 18, Number 5, August 1994
- Leif K. Jørgensen:
Contractions to k8. 431-448 - Herbert Fleischner:
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs. 449-459 - Zeng Min Song:
Pancyclic oriented graphs. 461-468 - Zdenek Ryjácek:
Almost claw-free graphs. 469-477 - Paul M. Weichsel:
Dominating sets in n-cubes. 479-488 - E. Sampathkumar, L. Pushpalatha:
Set domination in graphs. 489-495 - Guantao Chen, Richard H. Schelp:
Hamiltonian graphs with neighborhood intersections. 497-513 - John G. Gimbel, K. B. Reid:
Independent edges in bipartite graphs obtained from orientations of graphs. 515-533 - Crispin St. John Alvah Nash-Williams:
Infinite digraphs with nonreconstructible outvalency sequences. 535-537
Volume 18, Number 7, November 1994
- Edward A. Bertram, Paul Erdös, Peter Horák, Jozef Sirán, Zsolt Tuza:
Local and global average degree in graphs and multigraphs. 647-661 - Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and the cycle cover number of a graph. 663-672 - Hai-Yen Lee, Gerard J. Chang:
The w-median of a connected strongly chordal graph. 673-680 - Hans-Jürgen Bandelt, Henry Martyn Mulder, Elke Wilkeit:
Quasi-median graphs and algebras. 681-703 - Mostafa Blidia, Pierre Duchet, Frédéric Maffray:
On the orientation of meyniel graphs. 705-711 - Art Stephen Finbow, Bert L. Hartnell, Richard J. Nowakowski:
A characterization of well-covered graphs that contain neither 4- nor 5-cycles. 713-721 - Odile Favaron, David P. Sumner, Ewa Wojcicka:
The diameter of domination k-critical graphs. 723-734 - Dan Archdeacon:
Self-dual embeddings of complete multipartite graphs. 735-749 - R. Bruce Richter:
Walks through every edge exactly twice. 751-755
Volume 18, Number 8, December 1994
- Mekkia Kouider:
Covering vertices by cycles. 757-776 - Ranko Scepanovic, Gerhard Ringel, Dragan Marusic, Gek Ling Chia, Brian Alspach:
Nonseparable graphs with a given number of cycles. 777-789 - Xiaoyun Lu:
A chvátal-erdős type condition for hamiltonian graphs. 791-800 - Anthony B. Evans, Gerd Fricke, Carl C. Maneri, Terry A. McKee, Manley Perkel:
Representations of graphs modulo n. 801-815 - Jen-Shiuh Liu, Wen-Jing Hsu, Moon-Jung Chung:
Generalized fibonacci cubes are mostly hamiltonian. 817-829 - Dan McQuillan, R. Bruce Richter:
On 3-regular graphs having crossing number at least 2. 831-839 - Ronald J. Gould, Xingxing Yu:
On hamiltonian-connected graphs. 841-860
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-11-13 23:38 CET 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:
