Patrice Ossona de Mendez  Home/Search
Context
Related
| ehess.fr/centres/cams/perso...174.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ehess.fr/centres/cams/pers...pbib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We de ne here the reduced genus of a multigraph as the minimum genus of a hypergraph having the same adjacencies with the same multiplicities. Through a study of embedded hypergraphs, we obtain new bounds on the coloring number, clique number and point arboricity of simple graphs of a given reduced genus. We present some new related problems on graph coloring and graph representation. 1 Introduction Graph Coloring is a central topic in Graph Theory and numerous studies relate coloring... (Update)
Active bibliography (related documents): More All
1.0: Intersection Graphs of Jordan Arcs - de Mendez, de Fraysseix (1997) (Correct)
0.7: Contact Graphs of Line Segments are NP-complete - Hlineny (2001) (Correct)
0.5: Planar Graphs With Lists of 3 and 5 Colors - Tuza, Voigt (1998) (Correct)
Similar documents based on text: More All
0.5: On the Upper Chromatic Number of a Hypergraph - Voloshin (1995) (Correct)
0.3: Multicolour Turán problems - Keevash, Saks, Sudakov.. (Correct)
0.2: The Generalized Shortest Path Problem - Batagelj, Brandenburg, al. (Correct)
BibTeX entry: (Update)
@article{ demendez99reduced,
author = "Patrice Ossona de Mendez",
title = "The Reduced Genus of a Multigraph",
journal = "Lecture Notes in Computer Science",
volume = "1563",
pages = "16--??",
year = "1999",
url = "citeseer.ist.psu.edu/demendez99reduced.html" }
Citations (may not include all citations):151 Every planar map is four colorable (context) - Appel, Haken - 1977
151 Every planar map is four colorable (context) - Appel, Haken et al. - 1977
57 Rectilinear planar layout and bipolar orientation of planar .. (context) - Rosenstiehl, Tarjan - 1986
54 Graphes et hypergraphes (context) - Berge - 1973
41 Convex maps (context) - Stein - 1951
36 On straight line representation of planar graphs (context) - ary - 1948
30 Coloring the vertices of a graph in prescribed colors (context) - Vizing - 1976
28 Bemerkungen zum Vierfarbenproblem (context) - Wagner - 1936
23 Un code pour les graphes planaires et ses applications (context) - Cori - 1975
17 An inequality for the chromatic number of a graph (context) - Szekeres, Wilf - 1968
16 Every planar graph is 5-choosable (context) - Thomassen - 1994
14 Solution of the Heawood map coloring problem (context) - Ringel, Youngs - 1968
14 Choosability in graphs (context) - Erd, Rubin et al. - 1979
12 The four color theorem (context) - Robertson, Sanders et al. - 1997
10 The point arboricity of planar graphs (context) - Chartrand, Kronk - 1969
9 Sur le coloriage des graphes (context) - Mycielski - 1955
9 uber die Theorie der Polyeder (context) - Steinitz, Rademacher - 1934
9 Untersuchungen zum Vierfarbenproblem (context) - Heesch - 1969
8 Hypergraph planarity and the complexity of drawing Venn diag.. (context) - Johnson, Pollak - 1987
7 Probability and Computing (context) - de Fraysseix, de Mendez et al. - 1994
6 A not 3-choosable planar graph without 3-cycles (context) - Voigt - 1995
6 Map color theorem (context) - Heawood
5 Representation of planar graphs by segments (context) - de Fraysseix, de Mendez et al. - 1991
5 Hypermaps versus bipartite maps (context) - Walsh - 1975
3 A new proof of the four color theorem (context) - Robertson, Sanders et al. - 1996
2 Royal Holloway College (context) - Jones, Hypergraphs - 1976
2 volume 8 of Mathematics Studies (context) - White, Groups - 1984
2 Paths and circuits in critical graphs (context) - Kelly, Kelly - 1954
2 On chromatic numbers of nite set systems (context) - Lovasz - 1968
2 Stretchability of Jordan arc contact systems - de Fraysseix, de Mendez - 1998
2 colorable non 4-choosable planar graphs (context) - Voigt, Wirth - 1997
1 A ow approach to upward drawings of toroidal maps (context) - Mohar, Rosenstiehl - 1995
1 Intersection graphs of Jordan arcs - de Fraysseix, de Mendez - 1997
1 Solution to advanced problem no (context) - Descartes - 1954
1 Uspeki Mat (context) - Zykov - 1974
Documents on the same site (http://www.ehess.fr/centres/cams/person/pom/pbib.html): More
Geometric Realization Of Simplicial Complexes - de Mendez (1999) (Correct)
On Barycentric Representation Of Graphs - Vergnas, De Mendez (Correct)
The Generalized Shortest Path Problem - Batagelj, Brandenburg, al. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC