13 results on '"Frédéric Havet"'
Search Results
2. Identifying codes for infinite triangular grids with a finite number of rows.
3. Oriented trees in digraphs.
4. Grundy number and products of graphs.
5. Choosability of the square of planar subcubic graphs with large girth.
6. Hoàng-Reed conjecture holds for tournaments.
7. (p, 1)-Total labelling of graphs.
8. Stable set meeting every longest path.
9. Trees in tournaments.
10. Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.
11. Channel assignment and multicolouring of the induced subgraphs of the triangular lattice.
12. Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof.
13. Corrigendum to '(p, 1)-total labelling of graphs' [Discrete Mathematics 308 (2008) 496-513].
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.