Volume 22,
October 2005
7th International Colloquium on Graph Theory,
Hyeres,
France,
12-16 September 2005 Edited by André Raspaud and Olivier Delmas
- Z. R. Bogdanowicz:
Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks.
1-5
Electronic Edition (link) BibTeX
- Sergei Evdokimov, Ilia N. Ponomarenko:
Circulant graphs: efficient recognizing and isomorphism testing: (extended abstract).
7-12
Electronic Edition (link) BibTeX
- Bruno Courcelle:
Graph decompositions definable in monadic second-order logic.
13-19
Electronic Edition (link) BibTeX
- Martin Kochol:
About Counterexamples to The 5-Flow Conjecture.
21-24
Electronic Edition (link) BibTeX
- Benjamin Lévêque, Frédéric Maffray:
Coloring Meyniel graphs in linear time.
25-28
Electronic Edition (link) BibTeX
- Igor Vakula:
Claw-free graphs with non-clique mu-subgraphs and related geometries.
29-31
Electronic Edition (link) BibTeX
- P. V. Skums, S. V. Suzdal, R. I. Tyshkevich:
Edge intersection graphs of linear 3-uniform hypergraphs.
33-40
Electronic Edition (link) BibTeX
- Paulo Oswaldo Boaventura Netto:
P-antiregular graphs.
41-48
Electronic Edition (link) BibTeX
- Shiying Wang, Shangwei Lin:
The maximal restricted edge connectivity of Kautz undirected graphs: (extended abstract).
49-53
Electronic Edition (link) BibTeX
- Cédric Bentz:
Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs.
55-60
Electronic Edition (link) BibTeX
- Peter Hamburger, Weiting Cao:
Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs.
61-67
Electronic Edition (link) BibTeX
- Bin Dong, Fuji Zhang:
Perfect Matchings of the Small Polyominoes.
69-72
Electronic Edition (link) BibTeX
- Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for 3PC(., .)-free Berge graphs.
73-77
Electronic Edition (link) BibTeX
- Nicolas Trotignon:
On the structure of self-complementary graphs.
79-82
Electronic Edition (link) BibTeX
- A. Guénoche:
Comparing recent methods in graph partitioning.
83-89
Electronic Edition (link) BibTeX
- Pierre Ille:
A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product.
91-92
Electronic Edition (link) BibTeX
- MingChu Li, Liming Xiong:
Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs.
93-99
Electronic Edition (link) BibTeX
- Jaroslav Nesetril, Patrice Ossona de Mendez:
The Grad of a Graph and Classes with Bounded Expansion.
101-106
Electronic Edition (link) BibTeX
- Hiroshi Era, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
On upper bound graphs with forbidden subposets.
107-111
Electronic Edition (link) BibTeX
- F. Affif Chaouche, Abdelhafid Berrachedi:
Quasi-amply-regularity and Generalized Hamming Graphs.
113-117
Electronic Edition (link) BibTeX
- Stephan Dominique Andres:
The Positive Lightness of Digraphs, Embeddable in a Surface, without 4-Cycles.
119-122
Electronic Edition (link) BibTeX
- Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni:
Improper Colourings of Unit Disk Graphs.
123-128
Electronic Edition (link) BibTeX
- M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, José Cáceres, María Luz Puertas:
On the metric dimension of some families of graphs.
129-133
Electronic Edition (link) BibTeX
- Paulo Renato da Costa Pereira, Lilian Markenzon, Oswaldo Vernet:
The Reduced Prüfer Code for Rooted Labelled k-Trees.
135-139
Electronic Edition (link) BibTeX
- Ch. Sobhan Babu, Ajit A. Diwan:
Oriented Forests in Directed Graphs.
141-145
Electronic Edition (link) BibTeX
- Flavia Bonomo, Guillermo Durán:
Characterization and recognition of Helly circular-arc clique-perfect graphs.
147-150
Electronic Edition (link) BibTeX
- Andrei Gagarin, Wendy J. Myrvold, John Chambers:
Forbidden minors and subdivisions for toroidal graphs with no K3, 3's.
151-156
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov:
On maximum number of minimal dominating sets in graphs.
157-162
Electronic Edition (link) BibTeX
- François Genest:
The Pure Prime Circle Orbit Conjecture.
163-166
Electronic Edition (link) BibTeX
- Éric Duchene, Sylvain Gravier, Mehdi Mhalla:
Around Wythoff's game.
167-172
Electronic Edition (link) BibTeX
- Fabien de Montgolfier, Michaël Rao:
The bi-join decomposition.
173-177
Electronic Edition (link) BibTeX
- Liliana Alcón, Márcia R. Cerioli, Celina M. Herrera de Figueiredo, Marisa Gutierrez, João Meidanis:
Loop Graphs and Asteroidal Sets.
179-183
Electronic Edition (link) BibTeX
- Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana:
The P4-sparse Graph Sandwich Problem.
185-188
Electronic Edition (link) BibTeX
- Carla Silva Oliveira, Nair Maria Maia de Abreu, Ademir Fernando Pazoto:
Parameters of connectivity in (a, b)-linear graphs.
189-193
Electronic Edition (link) BibTeX
- Jun Fujisawa:
Heavy cycles in weighted graphs.
195-199
Electronic Edition (link) BibTeX
- Simon Spacapan:
Perfect codes in direct products of cycles.
201-205
Electronic Edition (link) BibTeX
- Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Bicolored matchings in some classes of graphs.
207-211
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca:
Connected Graph Searching in Outerplanar Graphs.
213-216
Electronic Edition (link) BibTeX
- C. N. Campos, Simone Dantas, Luerbio Faria, Sylvain Gravier:
2K2-Partition Problem.
217-221
Electronic Edition (link) BibTeX
- Ondrej Sýkora, Lubomir Torok, Imrich Vrto:
The Cyclic Antibandwidth Problem.
223-227
Electronic Edition (link) BibTeX
- Julien Moncel:
Codes Identifying Vertices in Graphs.
229-232
Electronic Edition (link) BibTeX
- Bostjan Bresar, Michael A. Henning, Douglas F. Rall:
Paired-domination of Cartesian products of graphs and rainbow domination.
233-237
Electronic Edition (link) BibTeX
- Brice Effantin, Hamamache Kheddouci:
Sum coloring of distance and circulant graphs.
239-244
Electronic Edition (link) BibTeX
- Isma Bouchemakh, Saliha Ouatiki:
On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of the finite poset.
245-251
Electronic Edition (link) BibTeX
- Kahina Meslem, Méziane Aïder:
On an extension of distance-hereditary graphs.
253-259
Electronic Edition (link) BibTeX
- Vadim E. Levit, Eugen Mandrescu:
Unicycle graphs and uniquely restricted maximum matchings.
261-265
Electronic Edition (link) BibTeX
- Noemi C. dos Santos, Sulamita Klein, Jayme Luiz Szwarcfiter:
A representation for the modular-pairs of a P4-reducible graph by modular decomposition.
267-270
Electronic Edition (link) BibTeX
- Ken-ichi Kawarabayashi, Paul Wollan:
Non-zero disjoint cycles in highly connected group labeled graphs.
271-275
Electronic Edition (link) BibTeX
- Raquel de Souza Francisco, Sulamita Klein, Loana Tito Nogueira:
Characterizing (k, l)-partitionable Cographs.
277-280
Electronic Edition (link) BibTeX
- Sang-il Oum:
Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract).
281-285
Electronic Edition (link) BibTeX
- Mucuy-kak Guevara, Hortensia Galeana-Sánchez:
New sufficient conditions for the existence of kernels in digraphs.
287-290
Electronic Edition (link) BibTeX
- Mateja Sajna, Primoz Potocnik:
Homogeneously almost self-complementary graphs.
291-294
Electronic Edition (link) BibTeX
- Hajime Matsumura:
Degree Conditions and Degree Bounded Trees.
295-298
Electronic Edition (link) BibTeX
- Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Ordered 3-colorings.
299-300
Electronic Edition (link) BibTeX
- Anant P. Godbole, Nathaniel G. Watson, Carl R. Yerger:
Cover Pebbling Thresholds for the Complete Graph.
301-304
Electronic Edition (link) BibTeX
- Daphne Der-Fen Liu, Xuding Zhu:
Coloring the Cartesian Sum of Graphs.
305-309
Electronic Edition (link) BibTeX
- Tomasz Tyrakowski, Zbigniew Palka:
A Random Graph Model of Mobile Wireless Networks.
311-314
Electronic Edition (link) BibTeX
- Chandan K. Dubey, Shashank K. Mehta:
Some Algorithms on Conditionally Critical Indecomposable Graphs.
315-319
Electronic Edition (link) BibTeX
- Petra Sparl, Janez Zerovnik:
2-local distributed algorithms for generalized coloring of hexagonal graphs.
321-325
Electronic Edition (link) BibTeX
- Paul Dorbec, Michel Mollard:
Perfect codes in Cartesian products of hypercube and multidimensional grid.
327-331
Electronic Edition (link) BibTeX
- Edita Mácajová, André Raspaud, Martin Skoviera:
Abelian Colourings of Cubic Graphs.
333-339
Electronic Edition (link) BibTeX
- Tomás Kaiser, Daniel Král, Serguei Norine:
Unions of perfect matchings in cubic graphs.
341-345
Electronic Edition (link) BibTeX
- Mustapha Kchikech, Riadh Khennoufa, Olivier Togni:
Radio k-Labelings for Cartesian Products of Graphs.
347-352
Electronic Edition (link) BibTeX
- Noga Alon, Jaroslaw Grytczuk:
Nonrepetitive colorings of graphs.
353-355
Electronic Edition (link) BibTeX
- Martin Charles Golumbic, Aviad Mintz, Udi Rotics:
Read-Once Functions Revisited and the Readability Number of a Boolean Function.
357-361
Electronic Edition (link) BibTeX
- Christophe Paul, Jan Arne Telle:
Edge-maximal graphs of branchwidth k.
363-368
Electronic Edition (link) BibTeX
- Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler:
On strongly circular-perfectness.
369-374
Electronic Edition (link) BibTeX
- Selma Djelloul:
Graph decompositions for cartesian products.
375-381
Electronic Edition (link) BibTeX
- Alain Guillet, Jimmy Leblet, Jean-Xavier Rampon:
Faithful extensions on finite orders classes.
383-386
Electronic Edition (link) BibTeX
- V. Sunitha:
Embedding some hierarchical caterpillars into hypercube.
387-389
Electronic Edition (link) BibTeX
- Gyula Pap:
Packings and 2-packings of A-paths.
391-400
Electronic Edition (link) BibTeX
- Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret:
On a weighted generalization of alpha-critical graphs.
401-404
Electronic Edition (link) BibTeX
- Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed covering of trees and the augmentation problem with odd diameter constraints.
405-408
Electronic Edition (link) BibTeX
- Shinya Fujita:
Recent Results on Disjoint Cycles in Graphs.
409-412
Electronic Edition (link) BibTeX
- Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet:
Extremities and orderings defined by generalized graph search algorithms.
413-420
Electronic Edition (link) BibTeX
- Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Edge Partition of Toroidal Graphs into Forests in Linear Time.
421-425
Electronic Edition (link) BibTeX
- Daniel Gonçalves, Pascal Ochem:
On some arboricities in planar graphs.
427-432
Electronic Edition (link) BibTeX
- Bertrand Jouve:
Transitive convex subsets in large tournaments.
433-437
Electronic Edition (link) BibTeX
- Yung-Ling Lai, Chang-Sin Tian, Ting-Chun Ko:
Edge Addition Number of Cartesian Product of Paths and Cycles.
439-444
Electronic Edition (link) BibTeX
- Derek G. Corneil, Richard Krueger:
Simple vertex ordering characterizations for graph search: (expanded abstract).
445-449
Electronic Edition (link) BibTeX
- Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Some families of arbitrarily vertex decomposable graphs.
451-454
Electronic Edition (link) BibTeX
- Robert Sámal:
Fractional covering by cuts.
455-459
Electronic Edition (link) BibTeX
- Fabrice Bazzaro, Cyril Gavoille:
Distance Labeling for Permutation Graphs.
461-467
Electronic Edition (link) BibTeX
- Andrey A. Dobrynin, Leonid S. Melnikov:
Some results on the Wiener index of iterated line graphs.
469-475
Electronic Edition (link) BibTeX
- Antoni Marczyk:
An Ore-type condition for arbitrarily vertex decomposable graphs.
477-480
Electronic Edition (link) BibTeX
- Alain Bretto, Luc Gillibert:
Symmetry and connectivity in G-graphs.
481-486
Electronic Edition (link) BibTeX
- Harald Gropp:
Existence and colouring of configurations with line size k=4.
487-490
Electronic Edition (link) BibTeX
- Irène Charon, Olivier Hudry, Antoine Lobstein:
On the Structure of Identifiable Graphs.
491-495
Electronic Edition (link) BibTeX
- Mitre C. Dourado, Priscila Petito, Rafael B. Teixeira:
Helly Property and Sandwich Graphs.
497-500
Electronic Edition (link) BibTeX
- Joseph D. Horton, Franziska Berger:
Minimum cycle bases of graphs over different fields.
501-505
Electronic Edition (link) BibTeX
- Federico Malucelli, Sara Nicoloso:
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings.
507-513
Electronic Edition (link) BibTeX
- Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen, M. Laffay:
AutoGraphiX: a survey.
515-520
Electronic Edition (link) BibTeX
- Arthur M. Farley, Andrzej Proskurowski:
Priority-Consistent Graphs.
521-526
Electronic Edition (link) BibTeX
- Hongmei He, Ondrej Sýkora, Imrich Vrto:
Crossing Minimisation Heuristics for 2-page Drawings.
527-534
Electronic Edition (link) BibTeX
- Olivier Baudon:
2-1 routing requests in the hypercube.
535-538
Electronic Edition (link) BibTeX
- Christian Avart, Vojtech Rödl, Mathias Schacht:
Every Monotone 3-Graph Property is Testable.
539-542
Electronic Edition (link) BibTeX
- Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz:
Hamiltonian cycles and paths through matchings.
543-547
Electronic Edition (link) BibTeX
- Anna Beata Kwiatkowska, Maciej M. Syslo:
On Posets of Page Number 2.
549-552
Electronic Edition (link) BibTeX
- Kathie Cameron, Jack Edmonds:
Colouring Some Classes of Perfect Graphs Robustly.
553-556
Electronic Edition (link) BibTeX
- C. N. Campos, Célia Picinin de Mello:
The total chromatic number of some bipartite graphs.
557-561
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:58:08 2009
by Michael Ley (ley@uni-trier.de)
