default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonid S. Melnikov
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j17]Andrey A. Dobrynin
, Leonid S. Melnikov:
4-chromatic Koester graphs. Discuss. Math. Graph Theory 32(4): 617-627 (2012)
2000 – 2009
- 2009
- [j16]Andrey A. Dobrynin, Leonid S. Melnikov:
4-chromatic edge critical Grötzsch-Sachs graphs. Discret. Math. 309(8): 2564-2566 (2009) - 2008
- [j15]Andrey A. Dobrynin, Leonid S. Melnikov:
Infinite families of 4-chromatic Grötzsch-Sachs graphs. J. Graph Theory 59(4): 279-292 (2008) - 2007
- [j14]Jens Schreyer, Hansjoachim Walther, Leonid S. Melnikov:
Vertex-oblique graphs. Discret. Math. 307(11-12): 1538-1544 (2007) - [j13]Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
Erdõs regular graphs of even degree. Discuss. Math. Graph Theory 27(2): 269-279 (2007) - 2006
- [j12]Andrey A. Dobrynin, Leonid S. Melnikov:
Counterexamples to Grötzsch-Sachs-Koester's conjecture. Discret. Math. 306(6): 591-594 (2006) - [j11]Andrey A. Dobrynin, Leonid S. Melnikov:
Wiener index of generalized stars and their quadratic line graphs. Discuss. Math. Graph Theory 26(1): 161-175 (2006) - 2005
- [j10]Andrey A. Dobrynin, Leonid S. Melnikov:
Wiener index for graphs and their line graphs with arbitrary large cyclomatic numbers. Appl. Math. Lett. 18(3): 307-312 (2005) - [j9]Andrey A. Dobrynin, Leonid S. Melnikov:
Some results on the Wiener index of iterated line graphs. Electron. Notes Discret. Math. 22: 469-475 (2005) - [j8]V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft:
Deeply asymmetric planar graphs. J. Comb. Theory B 95(1): 68-78 (2005) - 2004
- [j7]Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
Regular 4-critical graphs of even degree. J. Graph Theory 46(2): 103-130 (2004) - 2003
- [j6]Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
On 4-chromatic edge-critical regular graphs of high connectivity. Discret. Math. 260(1-3): 315-319 (2003) - 2002
- [j5]Leonid S. Melnikov, Artem V. Pyatkin:
Regular integral sum graphs. Discret. Math. 252(1-3): 237-245 (2002) - [j4]Andrey A. Dobrynin, Leonid S. Melnikov, Jens Schreyer, Hansjoachim Walther:
Some news about oblique graphs. Discuss. Math. Graph Theory 22(1): 39-50 (2002)
1990 – 1999
- 1999
- [j3]Leonid S. Melnikov, Vadym G. Vizing:
The edge chromatic number of a directed/mixed multigraph. J. Graph Theory 31(4): 267-273 (1999)
1980 – 1989
- 1987
- [j2]A. L. Semjonov, Leonid S. Melnikov, Vladimir A. Evstigneev:
Solving the Problems of Kinetics of Complex Reactions by Symbolic Algebraic Manipulation Methods. J. Symb. Comput. 3(3): 303-307 (1987) - 1980
- [j1]V. A. Aksionov, Leonid S. Melnikov:
Some counterexamples associated with the three-color problem. J. Comb. Theory B 28(1): 1-9 (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 20:29 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:
