default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 75
Volume 75, Number 1, January 1999
- Alan Stacey, Peter Weidl:
The Existence of Exactlym-Coloured Complete Subgraphs. 1-18 - Zhaoyang Wu:
On Extremal Connectivity Properties of Unavoidable Matroids. 19-45 - Aleksander Malnic
, Dragan Marusic:
Constructing 4-Valent 1/2-Transitive Graphs with a Nonsolvable Automorphism Group. 46-55 - Gelasio Salazar:
On the Intersections of Systems of Curves. 56-60 - Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen:
Highly Connected Sets and the Excluded Grid Theorem. 61-73 - Jianji Su:
The Number of Removable Edges in 3-Connected Graphs. 74-87 - Bing Wei:
On the Circumferences of Regular 2-Connected Graphs. 88-99 - Carsten Thomassen:
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5. 100-109 - Atsushi Kaneko, Hiroshi Maehara, Mamoru Watanabe:
On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph. 110-115 - Valery A. Liskovets:
A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps. 116-133 - Frédéric Maffray, Bruce A. Reed:
A Description of Claw-Free Perfect Graphs. 134-156 - Bing Wei:
A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs. 157-159 - Béla Bollobás:
Turán's Theorem and Maximal Degrees. 160-164
Volume 75, Number 2, March 1999
- Stephan Brandt:
9-Connected Claw-Free Graphs Are Hamilton-Connected. 167-173 - Tomasz Luczak:
R(Cn, Cn, Cn)<=(4+o(1)) n. 174-187 - Dragan Marusic, Cheryl E. Praeger:
Tetravalent Graphs Admitting Half-Transitive Group Actions: Alternating Cycles. 188-205 - Brian Curtin, Kazumasa Nomura:
Some Formulas for Spin Models on Distance-Regular Graphs. 206-236 - András Frank:
Finding Minimum Generators of Path Systems'. 237-244 - Xuding Zhu:
The Game Coloring Number of Planar Graphs. 245-258 - Gerard J. Chang, Daphne Der-Fen Liu, Xuding Zhu:
Distance Graphs and T-Coloring. 259-269 - Xiao Zhou, Takao Nishizeki:
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings. 270-287 - Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs. 288-301
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 2026-05-17 00:03 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:
