default search action
Louis V. Quintas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j17]Krystyna T. Balinska, Louis V. Quintas, Krzysztof Zwierzynski:
The Maximum Number Of One-Edge Extensions For Graphs With Bounded Degree. Ars Comb. 115: 101-114 (2014) - 2010
- [j16]Edgar G. DuCasse, Michael L. Gargano, Louis V. Quintas:
Value sets of graphs edge-weighted with elements of a finite abelian group. Discuss. Math. Graph Theory 30(1): 5-15 (2010)
2000 – 2009
- 2006
- [j15]Krystyna T. Balinska, Louis V. Quintas, Krzysztof Zwierzynski:
Extremal Size In Graphs With Bounded Degree. Ars Comb. 81 (2006) - 2005
- [c1]Sung-Hyuk Cha, Michael L. Gargano, Louis V. Quintas, Eric M. Wahl:
A Vascular Network Growth Estimation Algorithm Using Random Graphs. GbRPR 2005: 45-53 - 2002
- [j14]Louis V. Quintas, Jerzy Szymanski:
Digraphs Whose Nodes are Multigraphs Having Exactly Two Degrees f and 2. Ars Comb. 64: 117- (2002) - 2000
- [j13]Krystyna T. Balinska, Louis V. Quintas:
Results and Problems Concerning Edge Transformed Graphs. Electron. Notes Discret. Math. 5: 11-14 (2000)
1990 – 1999
- 1996
- [j12]Krystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski:
A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components. Discret. Appl. Math. 67(1-3): 13-25 (1996) - [j11]Krystyna T. Balinska, Louis V. Quintas:
Degrees in a digraph whose nodes are graphs. Discret. Math. 150(1-3): 17-29 (1996) - [j10]Krystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski:
A Kinetic Approach to the Random f-Graph Process with Nonuniform Edge Probabilities. J. Chem. Inf. Comput. Sci. 36(3): 347-350 (1996) - 1994
- [j9]Krystyna T. Balinska, Louis V. Quintas, Jerzy Szymanski:
Random Recursive Forests. Random Struct. Algorithms 5(1): 3-12 (1994) - 1993
- [j8]Krystyna T. Balinska, Louis V. Quintas:
The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4. Discret. Math. 114(1-3): 19-22 (1993) - [j7]Gyula O. H. Katona, Louis V. Quintas:
The largest component in a random subgraph of the n-cycle. Discret. Math. 121(1-3): 113-116 (1993) - 1990
- [j6]Krystyna T. Balinska, Louis V. Quintas:
The sequential generation of random f-graphs. Line maximal 2-, 3- and 4-graphs. Comput. Chem. 14(4): 323-328 (1990)
1980 – 1989
- 1988
- [j5]Robert Gross, Martin L. Yarmush, John W. Kennedy, Louis V. Quintas:
Antigenesis: A cascade-theoretical analysis of the size distributions of antigen - antibody complexes. Discret. Appl. Math. 19(1-3): 177-194 (1988) - 1984
- [j4]Claude W. Haigh, John W. Kennedy, Louis V. Quintas:
Counting and coding identity trees with fixed diameter and bounded degree. Discret. Appl. Math. 7(2): 141-160 (1984) - [j3]Zbigniew Palka, Louis V. Quintas:
Random subgraphs of the n-cycle. Discret. Math. 52(2-3): 243-251 (1984) - 1983
- [j2]John W. Kennedy, Louis V. Quintas:
Extremal f-trees and embedding spaces for molecular graphs. Discret. Appl. Math. 5(2): 191-209 (1983)
1970 – 1979
- 1979
- [j1]Pavol Hell, Louis V. Quintas:
An intermediate value theorem for graphs with given automorphism group. J. Graph Theory 3(1): 35-41 (1979)
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-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint