Thomas Zaslavsky

From MaRDI portal
Revision as of 20:35, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:189463

Available identifiers

zbMath Open zaslavsky.thomasDBLP19/1863WikidataQ7795392 ScholiaQ7795392MaRDI QIDQ189463

List of research outcomes

PublicationDate of PublicationType
Cobiased graphs: single-element extensions and elementary quotients of graphic matroids2024-03-19Paper
https://portal.mardi4nfdi.de/entity/Q61211632024-02-26Paper
Signed distance Laplacian matrices for signed graphs2024-01-17Paper
Apex Graphs and Cographs2023-10-03Paper
Projective Rectangles2023-07-08Paper
Total graph of a signed graph2022-12-08Paper
Vector Valued Switching in Signed Graphs2022-07-30Paper
Matroids of Gain Signed Graphs2022-06-01Paper
Two Hamiltonian cycles2022-03-14Paper
Characterizations of Some Parity Signed Graphs2022-02-08Paper
Strongly connectable digraphs and non-transitive dice2021-10-05Paper
The characteristic polynomial of a graph containing loops2021-06-07Paper
Signed distance in signed graphs2021-02-12Paper
Homomorphisms of signed graphs: an update2021-02-08Paper
A $q$-Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders2021-01-26Paper
A q-queens problem. VII. Combinatorial types of nonattacking chess riders2020-07-29Paper
The Projective Planarity Question for Matroids of $3$-Nets and Biased Graphs2020-05-07Paper
A \(q\)-queens problem IV. Attacking configurations and their denominators2019-12-17Paper
A $q$-Queens Problem. III. Nonattacking Partial Queens2019-09-19Paper
Biased graphs. VI: Synthetic geometry2019-08-30Paper
Transitive closure and transitive reduction in bidirected graphs2019-08-05Paper
A q-queens problem. VI. The bishops' period2019-07-25Paper
The dimension of the negative cycle vectors of a signed graph2019-07-25Paper
Negative (and positive) circles in signed graphs: a problem collection2018-06-20Paper
Mock threshold graphs2018-06-07Paper
Forbidden induced subgraphs2018-04-10Paper
Negative circles in signed graphs: a problem collection2018-04-10Paper
Resolution of indecomposable integral flows on signed graphs2017-08-29Paper
New concept of connection in signed graphs2017-08-04Paper
The dynamics of the forest graph operator2016-11-11Paper
Consistency in the naturally vertex-signed line graph of a signed graph2016-07-11Paper
Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs2016-03-14Paper
Characterization of line-consistent signed graphs2015-08-04Paper
A \(q\)-queens problem. II: The square board2015-06-04Paper
Voltage-Graphic Matroids2015-01-07Paper
Interference in Graphs2014-10-15Paper
A \(q\)-queens problem. I: General theory2014-09-09Paper
Signed Graphs and Geometry2014-09-09Paper
On Adjacency Matrices and Descriptors of Signed Cycle Graphs2014-09-09Paper
Directionally 2-Signed and Bidirected Graphs2014-09-09Paper
Which exterior powers are balanced?2013-06-07Paper
Six signed Petersen graphs, and their automorphisms2012-04-30Paper
Associativity in multiary quasigroups: The way of biased expansions2012-02-22Paper
Nonattacking queens in a rectangular strip2012-01-24Paper
On products and line graphs of signed graphs, their eigenvalues and energy2011-07-13Paper
Matrices in the Theory of Signed Simple Graphs2011-07-06Paper
Determinants in the Kronecker product of matrices: the incidence matrix of a complete graph2011-06-20Paper
Six Little Squares and How Their Numbers Grow2010-06-21Paper
Point- and arc-reaching sets of vertices in a digraph2010-05-14Paper
An elementary chromatic reduction for gain graphs and special hyperplane arrangements2010-03-26Paper
On the division of space by topological hyperplanes2009-12-03Paper
Totally frustrated states in the chromatic theory of gain graphs2009-01-27Paper
Biased graphs. VII: Contrabalance and antivoltages2007-10-10Paper
An enumerative geometry for magic and magilatin labellings2007-05-24Paper
Quasigroup associativity and biased expansion graphs2007-04-13Paper
The number of nowhere-zero flows on graphs and signed graphs2007-01-16Paper
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements2006-12-14Paper
Inside-out polytopes2006-09-14Paper
A simple algorithm that proves half‐integrality of bidirected network programming2006-09-12Paper
A new distribution problem of balls into urns, and how to color a graph by different-sized sets2006-09-01Paper
https://portal.mardi4nfdi.de/entity/Q54778082006-06-29Paper
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups2006-03-24Paper
Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry2005-11-01Paper
Periodicity in quasipolynomial convolution2005-04-25Paper
Biased graphs IV: Geometrical realizations2004-01-06Paper
Faces of a hyperplane arrangement enumerated by ideal dimension, with application to plane, plaids, and Shi2003-08-06Paper
A Meshalkin theorem for projective geometries2003-07-01Paper
A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains2003-03-26Paper
Perpendicular dissections of space2002-05-30Paper
The largest demigenus of a bipartite signed graph2002-03-29Paper
Supersolvable frame-matroid and graphic-lift lattices2001-08-12Paper
https://portal.mardi4nfdi.de/entity/Q49400202000-03-01Paper
Tractable partially ordered sets derived from root systems and biased graphs1999-05-16Paper
A mathematical bibliography of signed and gain graphs and allied areas1998-07-27Paper
Glossary of signed and gain graphs and allied areas1998-07-27Paper
Signed analogs of bipartite graphs1998-06-29Paper
The largest parity demigenus of a simple graph1997-08-12Paper
The order upper bound on parity embedding of a graph1997-02-17Paper
Biased graphs. III: Chromatic and dichromatic invariants1995-07-04Paper
The signed chromatic number of the projective plane and Klein bottle and antipodal graph coloring1995-07-02Paper
A Coding Approach to Signed Graphs1994-12-20Paper
Frame matroids and biased graphs1994-10-10Paper
Maximality of the cycle code of a graph1994-08-28Paper
The covering radius of the cycle code of a graph1993-12-02Paper
The projective-planar signed graphs1993-06-29Paper
Strong Tutte Functions of Matroids and Graphs1993-04-01Paper
Orientation embedding of signed graphs1993-01-17Paper
Orientation of signed graphs1992-06-26Paper
Biased graphs. II: The three matroids1992-06-25Paper
Biased graphs whose matroids are special binary matroids1992-06-25Paper
Biased graphs. I: Bias, balance, and gains1989-01-01Paper
Matroids Determine the Embeddability of Graphs in Surfaces1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42079291988-01-01Paper
Balanced decompositions of a signed graph1987-01-01Paper
The biased graphs whose matroids are binary1987-01-01Paper
Vertices of Localized Imbalance in a Biased Graph1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37689171987-01-01Paper
Asymptotic Expansions of Ratios of Coefficients of Orthogonal Polynomials with Exponential Weights1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36897781985-01-01Paper
How colorful the signed graph?1984-01-01Paper
Averaging sets: A generalization of mean values and spherical designs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30270571984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37524201984-01-01Paper
The slimmest arrangements of hyperplanes. I: Geometric lattices and projective arrangements1983-01-01Paper
Erratum to: T. Zaslavsky, signed graphs1983-01-01Paper
Uniform Distribution of a Subgraph in a Graph1983-01-01Paper
On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs1983-01-01Paper
Signed graphs1982-01-01Paper
Signed graph coloring1982-01-01Paper
Chromatic invariants of signed graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30394031982-01-01Paper
BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH1982-01-01Paper
The number of cladistic characters1981-01-01Paper
Complementary matching vectors and the uniform matching extension property1981-01-01Paper
The Geometry of Root Systems and Signed Graphs1981-01-01Paper
Characterizations of signed graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39344401981-01-01Paper
The slimmest arrangements of hyperplanes: II. Basepointed geometric lattices and Euclidean arrangements1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38724811979-01-01Paper
A combinatorial analysis of topological dissections1977-01-01Paper
Maximal dissections of a simplex1976-01-01Paper
Facing up to arrangements: face-count formulas for partitions of space by hyperplanes1975-01-01Paper
Counting the faces of cut-up spaces1975-01-01Paper
The Rhodes semilattice of a biased graph0001-01-03Paper
Weakly Negative Circles Versus Best Clustering in Signed Graphs0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Thomas Zaslavsky