Journals in DBLP
On spanning tree congestion of graphs. [Citation Graph (, )][DBLP ] Translation groups of Steiner loops. [Citation Graph (, )][DBLP ] Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number. [Citation Graph (, )][DBLP ] A note on Berge-Fulkerson coloring. [Citation Graph (, )][DBLP ] On the Laplacian spectral radii of trees. [Citation Graph (, )][DBLP ] Canonical Ramsey numbers and properly colored cycles. [Citation Graph (, )][DBLP ] Error-correcting codes from permutation groups. [Citation Graph (, )][DBLP ] A degree sum condition for graphs to be prism hamiltonian. [Citation Graph (, )][DBLP ] Minimal 2-matching-covered graphs. [Citation Graph (, )][DBLP ] Independent arcs of acyclic orientations of complete r-partite graphs. [Citation Graph (, )][DBLP ] Canonical and monophonic convexities in hypergraphs. [Citation Graph (, )][DBLP ] On colorings of graph powers. [Citation Graph (, )][DBLP ] Blockers and transversals. [Citation Graph (, )][DBLP ] The ordering of unicyclic graphs with the smallest algebraic connectivity. [Citation Graph (, )][DBLP ] Complete r-partite subgraphs of dense r-graphs. [Citation Graph (, )][DBLP ] Nash equilibria in all-optical networks. [Citation Graph (, )][DBLP ] Cayley digraphs with normal adjacency matrices. [Citation Graph (, )][DBLP ] Color degree and alternating cycles in edge-colored graphs. [Citation Graph (, )][DBLP ] Vertex domination of generalized Petersen graphs. [Citation Graph (, )][DBLP ] Netlike partial cubes, V: Completion and netlike classes. [Citation Graph (, )][DBLP ] Relations on generalized degree sequences. [Citation Graph (, )][DBLP ] Interleaving schemes on circulant graphs with two offsets. [Citation Graph (, )][DBLP ] On b-coloring of the Kneser graphs. [Citation Graph (, )][DBLP ] The maximum Randic index of chemical trees with k pendants. [Citation Graph (, )][DBLP ] Super-stationary set, subword problem and the complexity. [Citation Graph (, )][DBLP ] Incongruent restricted disjoint covering systems. [Citation Graph (, )][DBLP ] Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five. [Citation Graph (, )][DBLP ] On a graph's security number. [Citation Graph (, )][DBLP ] Edges of degree k in minimally restricted k-edge connected graphs. [Citation Graph (, )][DBLP ] Minimal and locally minimal games and game forms. [Citation Graph (, )][DBLP ] Trees with the second largest number of maximal independent sets. [Citation Graph (, )][DBLP ] Constructing continuum many countable, primitive, unbalanced digraphs. [Citation Graph (, )][DBLP ] Partitions of a set satisfying certain set of conditions. [Citation Graph (, )][DBLP ] Maximal Sidon sets and matroids. [Citation Graph (, )][DBLP ] Circular game chromatic number of graphs. [Citation Graph (, )][DBLP ] Primitive normal polynomials with the specified last two coefficients. [Citation Graph (, )][DBLP ] Game colouring of the square of graphs. [Citation Graph (, )][DBLP ] On a conjecture of V. Nikiforov. [Citation Graph (, )][DBLP ] The evolution of the min-min random graph process. [Citation Graph (, )][DBLP ] Regular Steinhaus graphs of odd degree. [Citation Graph (, )][DBLP ] On cyclic edge-connectivity of transitive graphs. [Citation Graph (, )][DBLP ] Maximal integral point sets in affine planes over finite fields. [Citation Graph (, )][DBLP ] Counting polycubes without the dimensionality curse. [Citation Graph (, )][DBLP ] On Beck's coloring of posets. [Citation Graph (, )][DBLP ] Stability of the path-path Ramsey number. [Citation Graph (, )][DBLP ] On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. [Citation Graph (, )][DBLP ] On graphs whose square have strong hamiltonian properties. [Citation Graph (, )][DBLP ] Generalization of transitive fraternal augmentations for directed graphs and its applications. [Citation Graph (, )][DBLP ] Bounds on the location of the maximum Stirling numbers of the second kind. [Citation Graph (, )][DBLP ] Packing and covering k-chain free subsets in Boolean lattices. [Citation Graph (, )][DBLP ] On the minimum real roots of the adjoint polynomial of a graph. [Citation Graph (, )][DBLP ] Degree sum conditions for oriented forests in digraphs. [Citation Graph (, )][DBLP ] A note on acyclic edge coloring of complete bipartite graphs. [Citation Graph (, )][DBLP ] The k-restricted edge connectivity of undirected Kautz graphs. [Citation Graph (, )][DBLP ] On spanning tree congestion. [Citation Graph (, )][DBLP ] Tree-length equals branch-length. [Citation Graph (, )][DBLP ]