On minimum degree, leaf number, traceability and Hamiltonicity in graphs Fulltext Access 6 Pages 2017
The geometric-arithmetic index and the chromatic number of connected graphs Fulltext Access 6 Pages 2017
An overpartition analogue of partitions with bounded differences between largest and smallest parts Fulltext Access 6 Pages 2017
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable Fulltext Access 6 Pages 2017
Improved algorithms for intermediate dataset storage in a cloud-based dataflow Fulltext Access 6 Pages 2017
Constructing error-correcting binary codes using transitive permutation groups Fulltext Access 6 Pages 2017
Monochromatic connecting colorings in strongly connected oriented graphs Fulltext Access 7 Pages 2017
Classification of nonorientable regular embeddings of cartesian products of graphs Fulltext Access 7 Pages 2017
Hankel determinants of linear combinations of consecutive Catalan-like numbers Fulltext Access 7 Pages 2017
A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs Fulltext Access 7 Pages 2017
When does the list-coloring function of a graph equal its chromatic polynomial Fulltext Access 7 Pages 2017
A study of a family of generating functions of Nelsen-Schmidt type and some identities on restricted barred preferential arrangements Fulltext Access 7 Pages 2017
On optimal approximability results for computing the strong metric dimension Fulltext Access 7 Pages 2017
The packing chromatic number of the infinite square lattice is between 13 and 15 Fulltext Access 7 Pages 2017
Parametric bisubmodular function minimization and its associated signed ring family Fulltext Access 7 Pages 2017
On bounding the difference between the maximum degree and the chromatic number by a constant Fulltext Access 7 Pages 2017
Pseudoachromatic and connected-pseudoachromatic indices of the complete graph Fulltext Access 7 Pages 2017
Enumerations of vertices among all rooted ordered trees with levels and degrees Fulltext Access 7 Pages 2017
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles Fulltext Access 7 Pages 2017
A note on an induced subgraph characterization of domination perfect graphs Fulltext Access 7 Pages 2017
Linear-time generation of uniform random derangements encoded in cycle notation Fulltext Access 7 Pages 2017
The computational complexity of three graph problems for instances with bounded minors of constraint matrices Fulltext Access 8 Pages 2017
Inapproximability results and bounds for the Helly and Radon numbers of a graph Fulltext Access 8 Pages 2017