The following pages link to Andre Raspaud (Q1112052):
Displaying 50 items.
- (Q186173) (redirect page) (← links)
- (Q326496) (redirect page) (← links)
- A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
- Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
- \((k,1)\)-coloring of sparse graphs (Q409448) (← links)
- \((k,j)\)-coloring of sparse graphs (Q411834) (← links)
- Vertex-arboricity of planar graphs without intersecting triangles (Q412284) (← links)
- The minimum identifying code graphs (Q423972) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- On backbone coloring of graphs (Q434190) (← links)
- Generalized power domination of graphs (Q444434) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297) (← links)
- Incidence coloring of planar graphs without adjacent small cycles (Q501990) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- Upper bounds on the linear chromatic number of a graph (Q626759) (← links)
- Circular flow on signed graphs (Q651035) (← links)
- Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
- Postman tours and cycle covers (Q686511) (← links)
- A note on the acyclic 3-choosability of some planar graphs (Q708344) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Homomorphisms from sparse graphs to the Petersen graph (Q709319) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735) (← links)
- Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- A note on 2-facial coloring of plane graphs (Q844207) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- The chromatic number of a signed graph (Q907266) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Some bounds on the injective chromatic number of graphs (Q960972) (← links)
- A relaxation of Havel's 3-color problem (Q963412) (← links)
- Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
- Perfect matchings with restricted intersection in cubic graphs (Q976153) (← links)
- On acyclic 4-choosability of planar graphs without short cycles (Q982617) (← links)
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- On the oriented chromatic number of grids (Q1007541) (← links)
- Acyclic and \(k\)-distance coloring of the grid (Q1014392) (← links)
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes (Q1025547) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
- Linear coloring of planar graphs with large girth (Q1045057) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- Short circuit covers for regular matroids with a nowhere zero 5-flow (Q1112053) (← links)
- Covering the vertices of a digraph by cycles of prescribed length (Q1174160) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- On the maximum average degree and the oriented chromatic number of a graph (Q1304809) (← links)
- Fulkerson's conjecture and circuit covers (Q1328394) (← links)
