The following pages link to Thomas Zaslavsky (Q189463):
Displaying 50 items.
- Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs (Q256998) (← links)
- The dynamics of the forest graph operator (Q339482) (← links)
- Six signed Petersen graphs, and their automorphisms (Q411664) (← links)
- On products and line graphs of signed graphs, their eigenvalues and energy (Q550619) (← links)
- Nonattacking queens in a rectangular strip (Q659600) (← links)
- Associativity in multiary quasigroups: The way of biased expansions (Q662366) (← links)
- The covering radius of the cycle code of a graph (Q686525) (← links)
- Consistency in the naturally vertex-signed line graph of a signed graph (Q726521) (← links)
- A \(q\)-queens problem. I: General theory (Q740671) (← links)
- Biased graphs. I: Bias, balance, and gains (Q750468) (← links)
- How colorful the signed graph? (Q759762) (← links)
- The slimmest arrangements of hyperplanes. I: Geometric lattices and projective arrangements (Q792330) (← links)
- Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements (Q857417) (← links)
- The number of nowhere-zero flows on graphs and signed graphs (Q859616) (← links)
- An enumerative geometry for magic and magilatin labellings (Q882765) (← links)
- On the division of space by topological hyperplanes (Q1041603) (← links)
- Averaging sets: A generalization of mean values and spherical designs (Q1078184) (← links)
- Balanced decompositions of a signed graph (Q1092068) (← links)
- The biased graphs whose matroids are binary (Q1117234) (← links)
- The number of cladistic characters (Q1149895) (← links)
- Complementary matching vectors and the uniform matching extension property (Q1153929) (← links)
- Signed graphs (Q1160198) (← links)
- Signed graph coloring (Q1165249) (← links)
- Chromatic invariants of signed graphs (Q1171067) (← links)
- Erratum to: T. Zaslavsky, signed graphs (Q1173106) (← links)
- Biased graphs. II: The three matroids (Q1174782) (← links)
- Orientation of signed graphs (Q1178039) (← links)
- Maximal dissections of a simplex (Q1228482) (← links)
- A combinatorial analysis of topological dissections (Q1257484) (← links)
- Tractable partially ordered sets derived from root systems and biased graphs (Q1267548) (← links)
- Maximality of the cycle code of a graph (Q1322205) (← links)
- Frame matroids and biased graphs (Q1329081) (← links)
- The largest parity demigenus of a simple graph (Q1362103) (← links)
- Signed analogs of bipartite graphs (Q1377721) (← links)
- A mathematical bibliography of signed and gain graphs and allied areas (Q1392296) (← links)
- Glossary of signed and gain graphs and allied areas (Q1392297) (← links)
- A Meshalkin theorem for projective geometries (Q1395829) (← links)
- Faces of a hyperplane arrangement enumerated by ideal dimension, with application to plane, plaids, and Shi (Q1397916) (← links)
- Biased graphs IV: Geometrical realizations (Q1417965) (← links)
- Perpendicular dissections of space (Q1597675) (← links)
- Mock threshold graphs (Q1637131) (← links)
- Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
- Periodicity in quasipolynomial convolution (Q1773152) (← links)
- Biased graphs whose matroids are special binary matroids (Q1813718) (← links)
- Supersolvable frame-matroid and graphic-lift lattices (Q1840839) (← links)
- A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains (Q1865391) (← links)
- The signed chromatic number of the projective plane and Klein bottle and antipodal graph coloring (Q1892835) (← links)
- Biased graphs. III: Chromatic and dichromatic invariants (Q1892851) (← links)
- The order upper bound on parity embedding of a graph (Q1924161) (← links)
- Which exterior powers are balanced? (Q1953535) (← links)
