Multiple partitions, lattice paths and a Burge–Bressoud-type correspondence Fulltext Access 9 Pages 2009
Hamiltonian cycles and dominating cycles passing through a linear forest Fulltext Access 9 Pages 2009
The orientable genus of some joins of complete graphs with large edgeless graphs Fulltext Access 9 Pages 2009
Undirected simple connected graphs with minimum number of spanning trees Fulltext Access 9 Pages 2009
On imprimitive multiplicity-free permutation groups the degree of which is the product of two distinct primes Fulltext Access 9 Pages 2009
Enumeration of the degree sequences of non-separable graphs and connected graphs Fulltext Access 9 Pages 2009
On certain spanning subgraphs of embeddings with applications to domination Fulltext Access 9 Pages 2009
Characterization, parity, and power sequences of locally finite doubly stochastic matrices Fulltext Access 9 Pages 2009
Integrating Multiple Approaches for Interacting with Dynamic Data Structure Visualizations Fulltext Access 9 Pages 2009
Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs Fulltext Access 9 Pages 2009
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model Fulltext Access 9 Pages 2009
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs Fulltext Access 9 Pages 2009
The number of independent sets in unicyclic graphs with a given diameter Fulltext Access 9 Pages 2009
Integration of topological measures for eliminating non-specific interactions in protein interaction networks Fulltext Access 9 Pages 2009
On the intersection of distance-jj-ovoids and subpolygons of generalized polygons Fulltext Access 9 Pages 2009
First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph Fulltext Access 9 Pages 2009
Degree condition for the existence of a kk-factor containing a given Hamiltonian cycle Fulltext Access 9 Pages 2009
A characterization of λd,1λd,1-minimal trees and other attainable classes Fulltext Access 9 Pages 2009
Total colorings and list total colorings of planar graphs without intersecting 4-cycles Fulltext Access 9 Pages 2009
A construction of dzdz-disjunct matrices by orthogonal space and discussion on their design parameters Fulltext Access 9 Pages 2009
Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles Fulltext Access 9 Pages 2009
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph Fulltext Access 9 Pages 2009