default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 258
Volume 258, Number 1-3, December 2002
- Gayla S. Domke, Johannes H. Hattingh, Lisa R. Markus, Elna Ungerer:
On parameters related to strong and weak domination in graphs. 1-11 - Stephan Foldes, Peter L. Hammer:
Disjunctive and conjunctive representations in finite lattices and convexity spaces. 13-25 - Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow:
On cop-win graphs. 27-41 - Arne Hoffmann:
Regular factors in regular multipartite graphs. 43-62 - Tommy R. Jensen:
Dense critical and vertex-critical graphs. 63-84 - Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto:
On a hamiltonian cycle in which specified vertices are not isolated. 85-91 - Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto:
On geometric independency trees for points in the plane. 93-104 - László Kászonyi:
A pumping lemma for DLI-languages. 105-122 - Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Whitney triangulations, local girth and iterated clique graphs. 123-135 - Igor Parfenoff, Florian Roussel, Irena Rusu:
Loose vertices in C4-free Berge graphs. 137-160 - Yan-ling Peng, Ru-Ying Liu:
Chromaticity of a family of K4-homeomorphs. 161-177 - Jonathan D. Stadler:
Juggling and vector compositions. 179-191 - Brett Stevens, Paul Buskell, Paule Ecimovic, Cristian Ivanescu, Abid Muslim Malik, Anamaria Savu, Tzvetalin S. Vassilev, Helen Verrall, Boting Yang, Zhiduo Zhao:
Solution of an outstanding conjecture: the non-existence of universal cycles with k=n-2. 193-204 - Ming Wang, Qiao Li:
Conditional edge connectivity properties, reliability comparisons and transitivity of graphs. 205-214 - Douglas R. Woodall:
Defective choosability results for outerplanar and related graphs. 215-223 - Jean-Michel Autebert, Matthieu Latapy, Sylviane R. Schwer:
Le treillis des chemins de Delannoy. 225-234 - Mireille Bousquet-Mélou, Andrew Rechnitzer:
Lattice animals and heaps of dimers. 235-274 - Petter Brändén, Anders Claesson, Einar Steingrímsson
:
Catalan continued fractions and increasing subsequences in permutations. 275-287 - Thomas W. Cusick, Pantelimon Stanica:
Fast evaluation, weights and nonlinearity of rotation-symmetric functions. 289-301 - Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Chromaticity of some families of dense graphs. 303-321 - John J. Lattanzio:
A note on a conjecture of Dirac. 323-330 - Lutz Volkmann:
Longest paths through an arc in strong semicomplete multipartite digraphs. 331-337 - Gerhard Wesp:
A note on the spectra of certain skew-symmetric {1, 0, -1}-matrices. 339-346 - Baogang Xu:
Two conjectures equivalent to the perfect graph conjecture. 347-351 - David Forge, Jorge L. Ramírez Alfonsín, H. Yeun:
Disconnected coverings for oriented matroids via simultaneous mutations. 353-359 - Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Total domination supercritical graphs with respect to relative complements. 361-371 - Alexandr V. Kostochka:
Equitable colorings of outerplanar graphs. 373-377 - Roman Nedela, Martin Skoviera, Andrej Zlatos:
Regular embeddings of complete bipartite graphs. 379-381 - Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li:
On generalized Ramsey numbers. 383-388
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 2025-01-08 20:20 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:
