default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Mollard
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b3]Ömer Egecioglu, Sandi Klavzar, Michel Mollard:
Fibonacci Cubes with Applications and Variations. WorldScientific 2023, ISBN 9789811269035, pp. 1-304- 2022
- [j41]Michel Mollard:
The (non-)existence of perfect codes in Lucas cubes. Ars Math. Contemp. 22(3): 3 (2022)
2010 – 2019
- 2019
- [j40]Sandi Klavzar
, Michel Mollard:
Daisy cubes and distance cube polynomial. Eur. J. Comb. 80: 214-223 (2019) - 2018
- [j39]Michel Mollard:
The existence of perfect codes in a family of generalized Fibonacci cubes. Inf. Process. Lett. 140: 1-3 (2018) - 2017
- [j38]Michel Mollard:
Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes. Discret. Appl. Math. 219: 219-221 (2017) - 2015
- [j37]Sylvain Gravier, Michel Mollard, Simon Spacapan, Sara Sabrina Zemljic:
On disjoint hypercubes in Fibonacci cubes. Discret. Appl. Math. 190-191: 50-55 (2015) - [j36]Michel Mollard, Mark Ramras:
Edge Decompositions of Hypercubes by Paths and by Cycles. Graphs Comb. 31(3): 729-741 (2015) - 2014
- [j35]Michel Mollard:
The domination number of Cartesian product of two directed paths. J. Comb. Optim. 27(1): 144-151 (2014) - 2013
- [j34]Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau:
New results on variants of covering codes in Sierpiński graphs. Des. Codes Cryptogr. 69(2): 181-188 (2013) - [j33]Michel Mollard:
On domination of Cartesian product of directed cycles: Results for certain equivalence. Discuss. Math. Graph Theory 33(2): 387-394 (2013) - 2012
- [j32]Michel Mollard:
Maximal hypercubes in Fibonacci and Lucas cubes. Discret. Appl. Math. 160(16-17): 2479-2483 (2012) - [j31]Aline Castro, Michel Mollard:
The eccentricity sequences of Fibonacci and Lucas cubes. Discret. Math. 312(5): 1025-1037 (2012) - [i1]Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau:
New results on variants of covering codes in Sierpinski graphs. CoRR abs/1201.1202 (2012) - 2011
- [j30]Aline Castro, Sandi Klavzar, Michel Mollard, Yoomi Rho:
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes. Comput. Math. Appl. 61(9): 2655-2660 (2011) - [j29]Sandi Klavzar, Michel Mollard, Marko Petkovsek:
The degree sequence of Fibonacci and Lucas cubes. Discret. Math. 311(14): 1310-1322 (2011) - [j28]Michel Mollard:
On perfect codes in Cartesian products of graphs. Eur. J. Comb. 32(3): 398-403 (2011) - [j27]Michel Mollard:
On Vertex Partitions of Hypercubes by Isometric Trees. SIAM J. Discret. Math. 25(2): 534-538 (2011) - 2010
- [j26]Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard:
Covering codes in Sierpinski graphs. Discret. Math. Theor. Comput. Sci. 12(3): 63-74 (2010)
2000 – 2009
- 2009
- [j25]Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard:
Weighted codes in Lee metrics. Des. Codes Cryptogr. 52(2): 209-218 (2009) - [j24]Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard:
Weighted perfect codes in Lee metric. Electron. Notes Discret. Math. 34: 477-481 (2009) - 2008
- [j23]Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon Spacapan:
Power Domination in Product Graphs. SIAM J. Discret. Math. 22(2): 554-567 (2008) - 2007
- [j22]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Michel Mollard:
Hamming polynomials and their partial derivatives. Eur. J. Comb. 28(4): 1156-1162 (2007) - 2006
- [j21]Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel:
A linear algorithm for minimum 1-identifying codes in oriented trees. Discret. Appl. Math. 154(8): 1246-1253 (2006) - 2005
- [j20]Paul Dorbec, Michel Mollard:
Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths. Electron. J. Comb. 12 (2005) - [j19]Paul Dorbec, Michel Mollard:
Perfect codes in Cartesian products of hypercube and multidimensional grid. Electron. Notes Discret. Math. 22: 327-331 (2005) - 2004
- [j18]Mohamed Kobeissi, Michel Mollard:
Disjoint cycles and spanning graphs of hypercubes. Discret. Math. 288(1-3): 73-87 (2004) - 2003
- [j17]Tomás Dvorák, Ivan Havel, Michel Mollard:
On paths and cycles dominating hypercubes. Discret. Math. 262(1-3): 121-129 (2003) - [j16]Sylvain Gravier, Sandi Klavzar, Michel Mollard:
Isometric embeddings of subdivided wheels in hypercubes. Discret. Math. 269(1-3): 287-293 (2003) - 2002
- [j15]Mohamed Kobeissi, Michel Mollard:
Spanning graphs of hypercubes: starlike and double starlike trees. Discret. Math. 244(1-3): 231-239 (2002) - 2001
- [j14]Sylvain Gravier, Michel Mollard, Charles Payan:
On the nonexistence of three-dimensional tiling in the Lee metric II. Discret. Math. 235(1-3): 151-157 (2001)
1990 – 1999
- 1999
- [j13]Abdelhafid Berrachedi, Michel Mollard:
Median graphs and hypercubes, some new characterizations. Discret. Math. 208-209: 71-75 (1999) - 1998
- [j12]Abdelhafid Berrachedi, Michel Mollard:
On two problems about (0, 2)-graphs and interval-regular graphs. Ars Comb. 49 (1998) - [j11]Sylvain Gravier, Michel Mollard, Charles Payan:
On the Non-existence of 3-Dimensional Tiling in the Lee Metric. Eur. J. Comb. 19(5): 567-572 (1998) - 1997
- [j10]Sylvain Gravier, Michel Mollard:
On Domination Numbers of Cartesian Product of Paths. Discret. Appl. Math. 80(2-3): 247-250 (1997) - [j9]Tomás Dvorák, Ivan Havel, Jean-Marie Laborde, Michel Mollard:
Spanning caterpillars of a hypercube. J. Graph Theory 24(1): 9-19 (1997) - 1993
- [j8]Michel Mollard:
Interval-regularity does not lead to interval motonicity. Discret. Math. 118(1-3): 233-237 (1993) - 1991
- [j7]Michel Mollard:
Cycle-regular graphs. Discret. Math. 89(1): 29-41 (1991) - [j6]Michel Mollard:
Two characterizations of generalized hypercube. Discret. Math. 93(1): 63-74 (1991) - 1990
- [j5]Michel Mollard, Charles Payan:
Some progress in the packing of equal circles in a square. Discret. Math. 84(3): 303-307 (1990)
1980 – 1989
- 1989
- [b2]Michel Mollard:
Quelques problèmes combinatoires sur l'hypercube et les graphes de Hamming. Joseph Fourier University, Grenoble, France, 1989 - [j4]Michel Mollard, Charles Payan:
On Two Conjectures About Set-graceful Graphs. Eur. J. Comb. 10(2): 185-187 (1989) - 1988
- [j3]Michel Mollard:
Un Nouvel Encadrement du Nombre de Cycles Hamiltoniens du n-Cube. Eur. J. Comb. 9(1): 49-52 (1988) - 1985
- [j2]François Jaeger, Abdelkader Khelladi, Michel Mollard:
On shortest cocycle covers of graphs. J. Comb. Theory B 39(2): 153-163 (1985) - 1984
- [j1]Michel Mollard:
Une nouvelle famille de 3-codes parfaits sur GF(q). Discret. Math. 49(2): 209-212 (1984) - 1981
- [b1]Michel Mollard:
Les Invariants du n-cube. Grenoble Institute of Technology, France, 1981
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 20:31 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:
