default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaryvonne Mahéo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j15]Maryvonne Mahéo, Jean-François Saclé:
SOME RESULTS ON (p, g, ∑)-VALUATION OF GRAPHS. Discret. Math. Algorithms Appl. 4(3) (2012)
2000 – 2009
- 2002
- [j14]Mekkia Kouider, Maryvonne Mahéo:
Connected [a, b]-factors in Graphs. Comb. 22(1): 71-82 (2002) - [j13]Mekkia Kouider, Maryvonne Mahéo:
Some bounds for the b-chromatic number of a grap. Discret. Math. 256(1-2): 267-277 (2002)
1990 – 1999
- 1998
- [j12]Krzysztof Brys, Mekkia Kouider, Zbigniew Lonc, Maryvonne Mahéo:
Decomposition of multigraphs. Discuss. Math. Graph Theory 18(2): 225-232 (1998) - 1997
- [j11]John Gimbel, Maryvonne Mahéo, Christine Virlouvet:
Double total domination of graphs. Discret. Math. 165-166: 343-351 (1997) - 1996
- [j10]Maryvonne Mahéo, Jean-François Saclé, Mariusz Wozniak:
Edge-disjoint Placement of Three Trees. Eur. J. Comb. 17(6): 543-563 (1996) - 1994
- [j9]Maryvonne Mahéo, Jean-François Saclé:
Some minimum broadcast graphs. Discret. Appl. Math. 53(1-3): 275-285 (1994) - [j8]Maryvonne Mahéo, Jean-François Saclé:
Note on the problem of gossiping in multidimensional grids. Discret. Appl. Math. 53(1-3): 287-290 (1994) - 1993
- [j7]Odile Favaron, Maryvonne Mahéo, Jean-François Saclé:
Some eigenvalue properties in graphs (conjectures of Graffiti - II). Discret. Math. 111(1-3): 197-220 (1993) - 1992
- [j6]Charles Delorme, Odile Favaron, Maryvonne Mahéo:
Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups. Eur. J. Comb. 13(1): 59-61 (1992) - 1991
- [j5]Odile Favaron, Maryvonne Mahéo, Jean-François Saclé:
On the residue of a graph. J. Graph Theory 15(1): 39-64 (1991)
1980 – 1989
- 1989
- [j4]Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo:
Hamiltonian decomposition of Cayley graphs of degree 4. J. Comb. Theory B 46(2): 142-153 (1989) - [j3]Odile Favaron, Mekkia Kouider, Maryvonne Mahéo:
Edge-vulnerability and mean distance. Networks 19(5): 493-504 (1989) - 1980
- [j2]Maryvonne Mahéo:
Strongly graceful graphs. Discret. Math. 29(1): 39-46 (1980) - [j1]Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo:
Cycles with a chord are graceful. J. Graph Theory 4(4): 409-415 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
