default search action
Thomas Zaslavsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j72]Daniel C. Slilaty, Thomas Zaslavsky:
Cobiased Graphs: Single-Element Extensions and Elementary Quotients of Graphic Matroids. Electron. J. Comb. 31(1) (2024) - [j71]Laura Anderson, Ting Su, Thomas Zaslavsky
:
Matroids of Gain Signed Graphs. Discret. Comput. Geom. 72(2): 503-549 (2024) - 2022
- [j70]Vaidy Sivaraman, Thomas Zaslavsky
Two Hamiltonian cycles. Discret. Math. 345(5): 112797 (2022) - 2021
- [j69]Mukti Acharya, Joseph Varghese Kureethara, Thomas Zaslavsky:
Characterizations of some parity signed graphs. Australas. J Comb. 81: 89-100 (2021) - [j68]Deepa Sinha, Bableen Kaur
The characteristic polynomial of a graph containing loops. Discret. Appl. Math. 300: 97-106 (2021) - [j67]Reza Naserasr, Éric Sopena, Thomas Zaslavsky:
Homomorphisms of signed graphs: An update. Eur. J. Comb. 91: 103222 (2021) - 2020
- [j66]Rigoberto Flórez, Thomas Zaslavsky:
Projective planarity of matroids of 3-nets and biased graphs. Australas. J Comb. 76: 299-338 (2020) - [j65]Christopher R. H. Hanusa, Thomas Zaslavsky:
A q-queens problem VII: Combinatorial types of nonattacking chess riders. Australas. J Comb. 77: 326-335 (2020) - [j64]Simon Joyce
Strongly connectable digraphs and non-transitive dice. AKCE Int. J. Graphs Comb. 17(1): 480-485 (2020) - [j63]Seth Chaiken, Christopher R. H. Hanusa
A q-Queens Problem IV. Attacking configurations and their denominators. Discret. Math. 343(2): 111649 (2020)
2010 – 2019
- 2019
- [j62]Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky:
A q-queens problem III. Nonattacking partial queens. Australas. J Comb. 74: 305-331 (2019) - [j61]Seth Chaiken, Christopher R. H. Hanusa
A q-queens problem. VI. The bishops' period. Ars Math. Contemp. 16(2): 549-561 (2019) - [j60]Alex Schaefer, Thomas Zaslavsky:
The dimension of the negative cycle vectors of a signed graph. Ars Math. Contemp. 16(2): 625-639 (2019) - [j59]Rigoberto Flórez
Biased graphs. VI. synthetic geometry. Eur. J. Comb. 81: 119-141 (2019) - 2018
- [j58]Thomas Zaslavsky:
Negative (and positive) circles in signed graphs: A problem collection. AKCE Int. J. Graphs Comb. 15(1): 31-48 (2018) - [j57]Richard Behr, Vaidy Sivaraman
Mock threshold graphs. Discret. Math. 341(8): 2159-2178 (2018) - 2017
- [j56]Beifang Chen, Jue Wang, Thomas Zaslavsky
Resolution of indecomposable integral flows on signed graphs. Discret. Math. 340(6): 1271-1286 (2017) - [j55]Deepa Sinha, Thomas Zaslavsky, Gyula O. H. Katona, Tao-Ming Wang:
Preface. Electron. Notes Discret. Math. 63: 1-2 (2017) - [j54]Thomas Zaslavsky:
Forbidden Induced Subgraphs. Electron. Notes Discret. Math. 63: 3-10 (2017) - [j53]Thomas Zaslavsky:
Negative Circles in Signed Graphs: A Problem Collection. Electron. Notes Discret. Math. 63: 41-47 (2017) - 2016
- [j52]Suresh Dara, Venkateshwarlu Deva, Suresh Manjanath Hegde, S. B. Rao, Thomas Zaslavsky
The dynamic of the forest graph operator. Discuss. Math. Graph Theory 36(4): 899-913 (2016) - [j51]David Forge, Thomas Zaslavsky:
Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs. J. Comb. Theory B 118: 186-227 (2016) - 2015
- [j50]Daniel C. Slilaty, Thomas Zaslavsky
Characterization of line-consistent signed graphs. Discuss. Math. Graph Theory 35(3): 589-594 (2015) - 2014
- [j49]Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky:
A q-Queens Problem. I. General Theory. Electron. J. Comb. 21(3): 3 (2014) - 2013
- [j48]Devlin Mallory, Abigail Raz, Christino Tamon, Thomas Zaslavsky:
Which Exterior Powers are Balanced? Electron. J. Comb. 20(2): 43 (2013) - 2012
- [j47]R. Balakrishnan, R. B. Bapat, Sandi Klavzar, Ambat Vijayakumar, Thomas Zaslavsky
Preface. Discret. Math. 312(9): 1493 (2012) - [j46]Thomas Zaslavsky
Six signed Petersen graphs, and their automorphisms. Discret. Math. 312(9): 1558-1583 (2012)
2000 – 2009
- 2009
- [j45]Pascal Berthomé, Raul Cordovil, David Forge, Véronique Ventos, Thomas Zaslavsky:
An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements. Electron. J. Comb. 16(1) (2009) - [j44]Thomas Zaslavsky
Totally frustrated states in the chromatic theory of gain graphs. Eur. J. Comb. 30(1): 133-156 (2009) - [j43]David Forge, Thomas Zaslavsky
On the division of space by topological hyperplanes. Eur. J. Comb. 30(8): 1835-1845 (2009) - 2007
- [j42]Thomas Zaslavsky
Biased graphs. VII. Contrabalance and antivoltages. J. Comb. Theory B 97(6): 1019-1040 (2007) - [j41]David Forge, Thomas Zaslavsky
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements. J. Comb. Theory A 114(1): 97-109 (2007) - 2006
- [j40]Matthias Beck, Thomas Zaslavsky
The number of nowhere-zero flows on graphs and signed graphs. J. Comb. Theory B 96(6): 901-918 (2006) - [j39]Konstantin A. Rybnikov, Thomas Zaslavsky
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups. J. Graph Theory 51(1): 1-21 (2006) - [j38]Ethan D. Bolker, Thomas Zaslavsky
A simple algorithm that proves half-integrality of bidirected network programming. Networks 48(1): 36-38 (2006) - [j37]Matthias Beck, Richard Ehrenborg, Thomas Zaslavsky, Michael Avidon, John H. Lindsey II:
Magic Squares and Nontransitive Dice: 11099. Am. Math. Mon. 113(5): 464-465 (2006) - 2005
- [j36]Konstantin A. Rybnikov, Thomas Zaslavsky
Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry. Discret. Comput. Geom. 34(2): 251-268 (2005) - 2004
- [j35]Thomas Zaslavsky:
Periodicity in Quasipolynomial Convolution. Electron. J. Comb. 11(2) (2004) - [j34]Matthias Beck, Richard Ehrenborg, Thomas Zaslavsky:
Problem 11099. Am. Math. Mon. 111(7): 625-626 (2004) - 2003
- [j33]Thomas Zaslavsky
Biased graphs IV: Geometrical realizations. J. Comb. Theory B 89(2): 231-297 (2003) - [j32]Matthias Beck, Thomas Zaslavsky
A Meshalkin theorem for projective geometries. J. Comb. Theory A 102(2): 433-441 (2003) - 2002
- [j31]Thomas Zaslavsky:
Perpendicular Dissections of Space. Discret. Comput. Geom. 27(3): 303-351 (2002) - [j30]Matthias Beck, Thomas Zaslavsky
A Shorter, Simpler, Stronger Proof of the Meshalkin-Hochberg-Hirsch Bounds on Componentwise Antichains. J. Comb. Theory A 100(1): 196-199 (2002) - 2001
- [j29]Thomas Zaslavsky
The largest demigenus of a bipartite signed graph. Discret. Math. 232(1-3): 189-193 (2001) - [j28]Thomas Zaslavsky
Supersolvable Frame-matroid and Graphic-lift Lattices. Eur. J. Comb. 22(1): 119-133 (2001)
1990 – 1999
- 1998
- [j27]Thomas Zaslavsky:
Signed analogs of bipartite graphs. Discret. Math. 179(1-3): 205-216 (1998) - 1997
- [j26]Thomas Zaslavsky:
Is There a Matroid Theory of Signed Graph Embedding? Ars Comb. 45 (1997) - [j25]Thomas Zaslavsky:
The Largest Parity Demigenus of a Simple Graph. J. Comb. Theory B 70(2): 325-345 (1997) - 1996
- [j24]Thomas Zaslavsky
The Order Upper Bound on Parity Embedding of a Graph. J. Comb. Theory, Ser. B 68(1): 149-160 (1996) - 1995
- [j23]Thomas Zaslavsky
The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring. J. Comb. Theory B 63(1): 136-145 (1995) - [j22]Thomas Zaslavsky
Biased Graphs .III. Chromatic and Dichromatic Invariants. J. Comb. Theory B 64(1): 17-88 (1995) - 1994
- [j21]Patrick Solé, Thomas Zaslavsky
Maximality of the cycle code of a graph. Discret. Math. 128(1-3): 401-405 (1994) - [j20]Thomas Zaslavsky
Frame Matroids and Biased Graphs. Eur. J. Comb. 15(3): 303-307 (1994) - [j19]Patrick Solé, Thomas Zaslavsky:
A Coding Approach to Signed Graphs. SIAM J. Discret. Math. 7(4): 544-553 (1994) - 1993
- [j18]Patrick Solé, Thomas Zaslavsky
The Covering Radius of the Cycle Code of a Graph. Discret. Appl. Math. 45(1): 63-70 (1993) - [j17]Thomas Zaslavsky
The projective-planar signed graphs. Discret. Math. 113(1-3): 223-247 (1993) - 1992
- [j16]Thomas Zaslavsky
Orientation embedding of signed graphs. J. Graph Theory 16(5): 399-422 (1992) - 1991
- [j15]Thomas Zaslavsky
Orientation of Signed Graphs. Eur. J. Comb. 12(4): 361-375 (1991) - [j14]Thomas Zaslavsky
Biased graphs. II. The three matroids. J. Comb. Theory B 51(1): 46-72 (1991) - 1990
- [j13]Thomas Zaslavsky
Biased graphs whose matroids are special binary matroids. Graphs Comb. 6(1): 77-93 (1990)
1980 – 1989
- 1989
- [j12]Thomas Zaslavsky
Biased graphs. I. Bias, balance, and gains. J. Comb. Theory B 47(1): 32-52 (1989) - 1987
- [j11]Thomas Zaslavsky
The biased graphs whose matroids are binary. J. Comb. Theory B 42(3): 337-347 (1987) - [j10]Thomas Zaslavsky
Balanced decompositions of a signed graph. J. Comb. Theory B 43(1): 1-13 (1987) - 1984
- [j9]Thomas Zaslavsky
How colorful the signed graph? Discret. Math. 52(2-3): 279-284 (1984) - 1983
- [j8]Thomas Zaslavsky:
Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74. Discret. Appl. Math. 5(2): 248 (1983) - 1982
- [j7]Thomas Zaslavsky
Signed graphs. Discret. Appl. Math. 4(1): 47-74 (1982) - [j6]Thomas Zaslavsky
Signed graph coloring. Discret. Math. 39(2): 215-228 (1982) - [j5]Thomas Zaslavsky
Chromatic invariants of signed graphs. Discret. Math. 42(2-3): 287-312 (1982) - 1981
- [j4]Thomas Zaslavsky
Complementary Matching Vectors and the Uniform Matching Extension Property. Eur. J. Comb. 2(1): 91-103 (1981) - [j3]Thomas Zaslavsky
Correction to "Complementary Matching Vectors and the Uniform Matching Extension Property". Eur. J. Comb. 2(3): 305 (1981) - [j2]Thomas Zaslavsky
Characterizations of signed graphs. J. Graph Theory 5(4): 401-406 (1981)
1970 – 1979
- 1976
- [j1]Thomas Zaslavsky
Maximal Dissections of a Simplex. J. Comb. Theory A 20(2): 244-257 (1976)
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-10-23 20:34 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: