Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 236
Volume 236, Number 1-3, June 2001
- Rafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda:
Preface. 1- - Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Denise Amar:
Cyclability and pancyclability in bipartite graphs. 3-11 - Krystyna T. Balinska, Slobodan K. Simic:
The nonregular, bipartite, integral graphs with maximum degree 4. Part I: basic properties. 13-24 - Vincent Barré, Jean-Luc Fouquet:
On minimal cutsets in P5-free minimal imperfect graphs. 25-36 - Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree. 37-42 - Halina Bielak, Izolda Gorgol
:
The planar Ramsey number for C4 and K5 is 13. 43-51 - Mieczyslaw Borowiecki, Peter Mihók:
On graphs with a local hereditary property. 53-58 - Charles Delorme:
Presentations of groups generated by transpositions. 59-64 - Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek:
Clique covering and degree conditions for hamiltonicity in claw-free graphs. 65-80 - Odile Favaron:
Inflated graphs with equal independence number and upper irredundance number. 81-94 - Jean-Luc Fouquet, Florian Roussel, P. Rubio, Henri Thuillier:
New classes of perfectly orderable graphs. 95-109 - Dalibor Froncek:
Self-complementary factors of almost complete tripartite graphs of even order. 111-122 - Waclaw Frydrych:
Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum. 123-130 - Krzysztof Giaro, Marek Kubale, Michal Malafiejski:
Consecutive colorings of the edges of general graphs. 131-143 - Heiko Harborth, Christian Thürmann:
Smallest limited snakes in d-grids. 145-149 - Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski:
The smallest hard-to-color graph for algorithm DSATUR. 151-165 - Stanislav Jendrol', Zdzislaw Skupien:
Local structures in plane maps and distance colourings. 167-177 - Michal Karonski, Magdalena Szymkowiak:
On a solution of a randomized three tracks variant of the Gate Matrix Layout problem. 179-189 - Arnfried Kemnitz, Heiko Harborth:
Plane integral drawings of planar graphs. 191-195 - Hamamache Kheddouci, Susan Marshall, Jean-François Saclé, Mariusz Wozniak:
On the packing of three graphs. 197-225 - Vadim E. Levit, Eugen Mandrescu:
On the structure of ?-stable graphs. 227-243 - Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski:
On minimal Folkman graphs. 245-262 - Zofia Majcher, Jerzy Michael, Joanna Górska, Zdzislaw Skupien:
The minimum size of fully irregular oriented graphs. 263-272 - Peter Mihók:
Minimal reducible bounds for the class of k-degenerate graphs. 273-279 - Vojislav Petrovic:
Path numbers of balanced bipartite tournaments. 281-285 - Leonid Plachta:
Voltage graphs, weight systems and odd symmetry. 287-313 - Erich Prisner:
Eulerian iterated line graphs and digraphs. 315-323 - Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Claw-free graphs with complete closure. 325-338 - Martin Sonntag, Hanns-Martin Teichert:
On the sum number and integral sum number of hypertrees and complete hypergraphs. 339-349 - Irmina A. Ziolo:
Subforests of bipartite digraphs -- the minimum degree condition. 351-365
a service of 
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-06-19 21:56 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:
