Graph Theory 2004

Paris, July 5-9, 2004

Contributed talks

Marién	Abreu	*k--path--connectivity and mk--generation*
Camino	Balbuena	*On the diameter of extremal graphs with high girth*
Cédric	Bentz	*Maximum edge disjoint paths and minimum unweighted multicut problems in grid graphs*
Abdelhafid	Berrachedi	*P₄ Structure in graphs generalizing hypercube type*
Etienné	Birmele	*Polynomial bounds for the tree-width*
Mostafa	Blidia	*Independence* *and domination in trees*
Kathie	Cameron	*Independent packings in structured graphs*
Charles	Cochet	*Goresky-Kottwitz-MacPherson graphs: a combinatorial tool for symplectic reduction*
Dragoš	Cvetkovič	*Cospectral graphs with least eigenvalue at least -2*
Pierre	Duchet	*Gallai equivalence in graphs, comparability graphs and interval hypergraphs*
Jürgen	Eckhoff	*The number of cliques in graphs*
Zsolt	Fekete	*A note on (k,l)-sparse graphs*
Celina	Figueiredo	*Extended skew partition problem*
Hortensia	Galeana-Sánchez	*Kernels and perfectness in arc-local tournament digraphs*
Isidoro	Gitler	*A new proof of Δ* *→ Y reducibility of three terminal planar graphs*
Martin	Golumbic	*Rank-tolerance graph classes*
Ronald	Gould	*Hamiltonian graphs with no other 2-factors*
Jaroslaw	Grytczuk	*Thue type colorings of graphs*
Ervin	Győri	*Graphs and designs in extremal hypergraphs*
Bert	Hartnell	*A characterization of the 1-well-covered graphs with no 4-cycles*
Ryan	Hayward	*Dead cell analysis: induced paths and the game of Hex*
Anthony	Hilton	*Some graph-theoretical generalizations of the Erdös-Ko-Rado theorem*
Chình	Hoáng	*A characterization of P₄-comparability graphs*
Matthew	Johnson	*The external network problem with vertex connectivity requirements*
Tamás	Király	*Hypergraph orientation with edge-connectivity and parity requirements*
Ephraim	Korach	*Anticoloring of general and special graphs*
Grzegorz	Kubicki	*Totally positive matrices and totally positive hypergraphs*
Małgorzata	Kuchta	*On an universal best choice algorithm for partially ordered sets*
Domenico	Labbate	*Graphs and digraphs with all 2-factors isomorphic*
Renu	Laskar	*t-partitions and s-complete t-partitions of a graph*
Martin	Löhnertz	*Finding one of many disjoint perfect matchings in a bipartite graph*
Márton	Makai	*On maximum cost K_t,t-free t-matchings of bipartite graphs*
Xavier	Marcote	*On restricted connectivities of a family of graphs*
Dániel	Marx	*Precoloring extension on chordal graphs*
Bojan	Mohar	*An analogue of the Descartes-Euler formula for infinite graphs and Higuchi's conjecture*
Mickael	Montassier	*On the acyclic choosability of graphs*
Michał	Morayne	*Combinatorial aspects of the poset extension of the the secretary problem*
Joy	Morris	*Automorphisms of circulant graphs*
Morten	Nielsen	*Minimum cycle factors in quasi-transitive digraphs*
Shmuel	Onn	*Nowhere-zero flow polynomials*
Gyula	Pap	*Path-cycle factors in directed graphs*
Ignacio	Pelayo	*Geodesic convexity and chordal graphs*
Christophe	Picouleau	*On a problem of coloured matchings in regular bipartite graphs*
Michael	Plummer	*Matchings in 3-vertex-critical graphs*
Paula	Rama	*Eigenvectors and eigenvalues of graphs with regularity constraints*
András	Recski	*On the generalization of the matroid parity problem*
Pastora	Revuelta	*Matricial construction of k-colourings on regular planar lattices*
Ingo	Schiermeyer	*An asymptotic result for the path partition conjecture*
John	Sheehan	*Pfaffian cubic graphs*
Vera	Sòs	*Hypergraph problems*
Ladislav	Stacho	*Traversal of quasi-planar graphs without using mark bits*
Jácint	Szabò	*The Gallai-Edmonds decomposition for the k-piece packing problem*
Stéphan	Thomassé	*Path and circuit covers of digraphs*
Csaba	Tòth	*Guarding disjoint quadrilaterals in the plane*
Nicolas	Trotignon	*Algorithms for perfectly contractile graphs*
Jan	Van den Heuvel	*Transversals of subtree hypergraphs and the source location problem*
Andrej	Vodopivec	*On polyhedral embeddings of cubic graphs*
Annegret	Wagler	*Perfectness is an elusive graph property*
Douglas	West	*Proofs via hypergraphs for strongly chordal and chordal bipartite graphs*
Mariusz	Woźniak	*On neighbour distinguishing index of a graph*
Joseph	Zaks	*Some geometric graphs and the Beckman-quarles theorem*
Sanming	Zhou	*On a family of imprimitive symmetric graphs*