default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 73
Volume 73, Number 1, May 1998
- Ron Aharoni, Ron Holzman:
Fractional Kernels in Digraphs. 1-6 - Jens Lagergren:
Upper Bounds on the Size of Obstructions and Intertwines. 7-40 - Dragan Marusic
:
Half-Transitive Group Actions on Finite Graphs of Valency 4. 41-76 - Dan Archdeacon, C. Paul Bonnington, Jozef Sirán:
A Nebeský-Type Characterization for Relative Maximum Genus. 77-98
Volume 73, Number 2, July 1998
- Edwin R. van Dam:
Nonregular Graphs with Three Eigenvalues. 101-118 - Lenhard L. Ng:
Hamiltonian Decomposition of Lexicographic Products of Digraphs. 119-129 - Judith Keijsper, Rudi Pendavingh:
An Efficient Algorithm for Minimum-Weight Bibranching. 130-145 - Pavel Valtr:
On the Density of Subgraphs in a Graph with Bounded Independence Number. 146-158 - Dan Pritikin:
All Unit-Distance Graphs of Order 6197 Are 6-Colorable. 159-163 - Cai Heng Li, Cheryl E. Praeger, Ming Yao Xu:
Isomorphisms of Finite Cayley Digraphs of Bounded Valency. 164-183 - Judith Keijsper, Alexander Schrijver:
On Packing Connectors. 184-188 - Michael O. Albertson:
You Can't Paint Yourself into a Corner. 189-194 - Xuding Zhu:
Pattern Periodic Coloring of Distance Graphs. 195-206
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-15 19:21 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:
