default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLadislav Nebeský
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j21]Henry Martyn Mulder
, Ladislav Nebesky:
Guides and shortcuts in graphs. Discret. Math. 313(19): 1897-1907 (2013)- 2010
- [j20]Ladislav Nebesky:
Distance-hereditary graphs and signpost systems. Discret. Math. 310(3): 527-530 (2010)
2000 – 2009
- 2009
- [j19]Henry Martyn Mulder, Ladislav Nebesky:
Axiomatic characterization of the interval function of a graph. Eur. J. Comb. 30(5): 1172-1185 (2009) - 2007
- [j18]Ladislav Nebesky:
The interval function of a connected graph and road systems. Discret. Math. 307(16): 2067-2073 (2007) - [j17]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Distance defined by spanning trees in graphs. Discuss. Math. Graph Theory 27(3): 485-506 (2007) - 2006
- [j16]Henry Martyn Mulder, Ladislav Nebesky:
Leaps: an approach to the block structure of a graph. Discuss. Math. Graph Theory 26(1): 77-90 (2006) - 2005
- [j15]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Hamiltonian colorings of graphs. Discret. Appl. Math. 146(3): 257-272 (2005) - [j14]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
On hamiltonian colorings of graphs. Discret. Math. 290(2/3): 133-143 (2005) - 2004
- [j13]Ladislav Nebesky:
Intervals and steps in a connected graph. Discret. Math. 286(1-2): 151-156 (2004) - [j12]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Radio k-colorings of paths. Discuss. Math. Graph Theory 24(1): 5-21 (2004) - 2003
- [j11]Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Greedy F-colorings of graphs. Discret. Math. 272(1): 37-46 (2003) - [j10]Henry Martyn Mulder, Ladislav Nebesky:
Modular and median signpost systems and their underlying graphs. Discuss. Math. Graph Theory 23(2): 309-324 (2003) - [j9]Henry Martyn Mulder, Ladislav Nebesky:
Signpost Systems and Their Underlying Graphs. Electron. Notes Discret. Math. 13: 76-80 (2003) - 2001
- [j8]Ladislav Nebesky:
The set of geodesics in a graph. Discret. Math. 235(1-3): 323-326 (2001)
1980 – 1989
- 1981
- [j7]Ladislav Nebesky:
Every connected, locally connected graph is upper embeddable. J. Graph Theory 5(2): 205-207 (1981)
1970 – 1979
- 1978
- [j6]Ladislav Nebesky:
Some sufficient conditions for the existence of a 1-factor. J. Graph Theory 2(3): 251-255 (1978) - 1977
- [j5]Ladislav Nebesky:
On induced subgraphs of a block. J. Graph Theory 1(1): 69-74 (1977) - 1973
- [j4]Ladislav Nebeský:
An outerplanar test of linguistic projectivity. Kybernetika 9(2): 81-83 (1973) - 1972
- [j3]Ladislav Nebeský:
A planar test of linguistic projectivity. Kybernetika 8(4): 351-354 (1972) - 1971
- [j2]Ladislav Nebesky:
Left-right double trees. Discret. Math. 1(1): 73-81 (1971) - [j1]Ladislav Nebeský:
On one of the boundaries of the constituent conception of grammar. Kybernetika 7(3): 227-229 (1971)
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-04-24 22:59 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:
