default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 89
Volume 89, Number 1, September 2003
- Ya-Chen Chen:
Triangle-free Hamiltonian Kneser graphs. 1-16 - Hirobumi Mizuno, Iwao Sato:
On the weighted complexity of a regular covering of a graph. 17-26 - Hirobumi Mizuno, Iwao Sato:
Bartholdi zeta functions of graph coverings. 27-41 - Neil Robertson, Paul D. Seymour
:
Graph Minors. XVI. Excluding a non-planar graph. 43-76 - Neil Robertson, Paul D. Seymour:
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. 77-108 - Sabin Cautis, David M. Jackson:
The matrix of chromatic joins and the Temperley-Lieb algebra. 109-155
Volume 89, Number 2, November 2003
- Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei:
Extremal graphs for intersecting cliques. 159-171 - Genghua Fan:
Covers of eulerian graphs. 173-187 - Matej Stehlík:
Critical graphs with connected complements. 189-194 - Peter Che Bor Lam, Wensong Lin, Guohua Gu, Zengmin Song:
Circular chromatic number and a generalization of the construction of Mycielski. 195-205 - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota:
Subgraphs of graphs on surfaces with high representativity . 207-229 - Thomas Zaslavsky:
Biased graphs IV: Geometrical realizations. 231-297
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-06 20:18 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:
