Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Krystyna T. Balinska
@article{DBLP:journals/arscom/BalinskaQZ14, author = {Krystyna T. Balinska and Louis V. Quintas and Krzysztof Zwierzynski}, title = {The Maximum Number Of One-Edge Extensions For Graphs With Bounded Degree}, journal = {Ars Comb.}, volume = {115}, pages = {101--114}, year = {2014}, timestamp = {Fri, 05 Sep 2014 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/arscom/BalinskaQZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arscom/BalinskaQZ06, author = {Krystyna T. Balinska and Louis V. Quintas and Krzysztof Zwierzynski}, title = {Extremal Size In Graphs With Bounded Degree}, journal = {Ars Comb.}, volume = {81}, year = {2006}, timestamp = {Fri, 28 Nov 2008 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arscom/BalinskaQZ06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BalinskaSZ04, author = {Krystyna T. Balinska and Slobodan K. Simic and Krzysztof T. Zwierzyski}, title = {Which non-regular bipartite integral graphs with maximum degree four do not have pm1 as eigenvalues?}, journal = {Discret. Math.}, volume = {286}, number = {1-2}, pages = {15--24}, year = {2004}, url = {https://doi.org/10.1016/j.disc.2003.11.040}, doi = {10.1016/J.DISC.2003.11.040}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BalinskaSZ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BalinskaS01, author = {Krystyna T. Balinska and Slobodan K. Simic}, title = {The nonregular, bipartite, integral graphs with maximum degree 4. Part {I:} basic properties}, journal = {Discret. Math.}, volume = {236}, number = {1-3}, pages = {13--24}, year = {2001}, url = {https://doi.org/10.1016/S0012-365X(00)00426-X}, doi = {10.1016/S0012-365X(00)00426-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BalinskaS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BalinskaQ00, author = {Krystyna T. Balinska and Louis V. Quintas}, title = {Results and Problems Concerning Edge Transformed Graphs}, journal = {Electron. Notes Discret. Math.}, volume = {5}, pages = {11--14}, year = {2000}, url = {https://doi.org/10.1016/S1571-0653(05)80112-X}, doi = {10.1016/S1571-0653(05)80112-X}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BalinskaQ00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BalinskaGQS96, author = {Krystyna T. Balinska and Henryk Galina and Louis V. Quintas and Jerzy Szymanski}, title = {A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components}, journal = {Discret. Appl. Math.}, volume = {67}, number = {1-3}, pages = {13--25}, year = {1996}, url = {https://doi.org/10.1016/0166-218X(95)00008-F}, doi = {10.1016/0166-218X(95)00008-F}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BalinskaGQS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BalinskaQ96, author = {Krystyna T. Balinska and Louis V. Quintas}, title = {Degrees in a digraph whose nodes are graphs}, journal = {Discret. Math.}, volume = {150}, number = {1-3}, pages = {17--29}, year = {1996}, url = {https://doi.org/10.1016/0012-365X(95)00172-S}, doi = {10.1016/0012-365X(95)00172-S}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BalinskaQ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcisd/BaliskaGQS96, author = {Krystyna T. Balinska and Henryk Galina and Louis V. Quintas and Jerzy Szymanski}, title = {A Kinetic Approach to the Random f-Graph Process with Nonuniform Edge Probabilities}, journal = {J. Chem. Inf. Comput. Sci.}, volume = {36}, number = {3}, pages = {347--350}, year = {1996}, url = {https://doi.org/10.1021/ci9500896}, doi = {10.1021/CI9500896}, timestamp = {Thu, 14 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcisd/BaliskaGQS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/BalinskaQS94, author = {Krystyna T. Balinska and Louis V. Quintas and Jerzy Szymanski}, title = {Random Recursive Forests}, journal = {Random Struct. Algorithms}, volume = {5}, number = {1}, pages = {3--12}, year = {1994}, url = {https://doi.org/10.1002/rsa.3240050103}, doi = {10.1002/RSA.3240050103}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/BalinskaQS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BalinskaQ93, author = {Krystyna T. Balinska and Louis V. Quintas}, title = {The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f{\textgreater};4}, journal = {Discret. Math.}, volume = {114}, number = {1-3}, pages = {19--22}, year = {1993}, url = {https://doi.org/10.1016/0012-365X(93)90352-T}, doi = {10.1016/0012-365X(93)90352-T}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BalinskaQ93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/candc/BalinskaQ90, author = {Krystyna T. Balinska and Louis V. Quintas}, title = {The sequential generation of random f-graphs. Line maximal 2-, 3- and 4-graphs}, journal = {Comput. Chem.}, volume = {14}, number = {4}, pages = {323--328}, year = {1990}, url = {https://doi.org/10.1016/0097-8485(90)80039-5}, doi = {10.1016/0097-8485(90)80039-5}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/candc/BalinskaQ90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.