Enumeration formulas for standard Young tableaux of nearly hollow rectangular shapes Fulltext Access 6 Pages 2018
Solving the maximum internal spanning tree problem on interval graphs in polynomial time Fulltext Access 6 Pages 2018
On the unimodality of independence polynomials of very well-covered graphs Fulltext Access 6 Pages 2018
A short disproof of Euler's conjecture based on quasi-difference matrices and difference matrices Fulltext Access 6 Pages 2018
Descendant sets in infinite, primitive highly arc transitive digraphs with prime power out-valency Fulltext Access 6 Pages 2018
A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree Fulltext Access 6 Pages 2018
Approximately locating an invisible agent in a graph with relative distance queries Fulltext Access 6 Pages 2018
An infinite family of subcubic graphs with unbounded packing chromatic number Fulltext Access 6 Pages 2018
Relationship between superstring and compression measures: New insights on the greedy conjecture Fulltext Access 6 Pages 2018
Wiener index and Harary index on Hamilton-connected graphs with large minimum degree Fulltext Access 6 Pages 2018
Extremal bipartite graphs of given connectivity with respect to matching energy Fulltext Access 6 Pages 2018
Every signed planar graph without cycles of length from 4 to 8 is 3-colorable Fulltext Access 7 Pages 2018
On degree sum conditions for 2-factors with a prescribed number of cycles Fulltext Access 7 Pages 2018
An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs Fulltext Access 7 Pages 2018
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs Fulltext Access 7 Pages 2018
Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring Fulltext Access 7 Pages 2018
Sufficient conditions for a balanced bipartite digraph to be even pancyclic Fulltext Access 7 Pages 2018
On the sum of the squares of all distances in bipartite graphs with given connectivity Fulltext Access 7 Pages 2018
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights Fulltext Access 7 Pages 2018
On the chromatic index of join graphs and triangle-free graphs with large maximum degree Fulltext Access 7 Pages 2018
On the reduced Euler characteristic of independence complexes of circulant graphs Fulltext Access 7 Pages 2018
Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs Fulltext Access 7 Pages 2018
Some results on the independence number of connected domination critical graphs Fulltext Access 7 Pages 2018