Dan Pritikin

From MaRDI portal
Revision as of 07:58, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:409452

Available identifiers

zbMath Open pritikin.danWikidataQ102159911 ScholiaQ102159911MaRDI QIDQ409452

List of research outcomes





PublicationDate of PublicationType
Hamiltonian cycles in k‐partite graphs2020-05-21Paper
Near embeddings of hypercubes into Cayley graphs on the symmetric group2018-09-14Paper
Embedding multidimensional grids into optimal hypercubes2014-09-10Paper
Arrangements of \(k\)-sets with intersection constraints2012-09-12Paper
Representation numbers of complete multipartite graphs2012-04-13Paper
Near Optimal Bounds for Steiner Trees in the Hypercube2012-02-11Paper
Representation Numbers of Stars2011-01-13Paper
On the unitary Cayley graph of a finite ring2010-03-26Paper
Separation numbers of trees2009-09-10Paper
κ-Dependence and Domination in Kings Graphs2009-04-21Paper
Edge-bandwidth of the triangular grid2009-04-07Paper
A solitaire game played on 2-colored graphs2009-01-28Paper
The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem2005-06-01Paper
Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints2004-02-03Paper
Irredundance and domination in kings graphs2003-04-28Paper
All unit-distance graphs of order 6197 are 6-colorable1999-01-03Paper
https://portal.mardi4nfdi.de/entity/Q43442271998-06-01Paper
Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group1996-12-01Paper
https://portal.mardi4nfdi.de/entity/Q48710431996-07-17Paper
https://portal.mardi4nfdi.de/entity/Q48635171996-04-22Paper
Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube1995-01-02Paper
Eigenvalues and separation in graphs1993-05-16Paper
On the separation number of a graph1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30337951988-01-01Paper
The bichromaticity of cylinder graphs and torus graphs1987-01-01Paper
Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs1986-01-01Paper
Bichromaticity of bipartite graphs1985-01-01Paper

Research outcomes over time

This page was built for person: Dan Pritikin