|
Journals in DBLP
Preface. [Citation Graph (, )][DBLP]
Removable matchings and hamiltonian cycles. [Citation Graph (, )][DBLP]
Nowhere-zero 4-flow in almost Petersen-minor free graphs. [Citation Graph (, )][DBLP]
Edge-connectivity and edge-disjoint spanning trees. [Citation Graph (, )][DBLP]
Note on cycle double covers of graphs. [Citation Graph (, )][DBLP]
Relaxed very asymmetric coloring games. [Citation Graph (, )][DBLP]
Long cycles in 4-connected planar graphs. [Citation Graph (, )][DBLP]
Size bipartite Ramsey numbers. [Citation Graph (, )][DBLP]
Codiameters of 3-domination critical graphs with toughness more than one. [Citation Graph (, )][DBLP]
Factor-critical property in 3-dominating-critical graphs. [Citation Graph (, )][DBLP]
The Ramsey number R(C8, K8). [Citation Graph (, )][DBLP]
Maximum bipartite subgraphs of cubic triangle-free planar graphs. [Citation Graph (, )][DBLP]
On 2-factors with cycles containing specified edges in a bipartite graph. [Citation Graph (, )][DBLP]
The edge version of Hadwiger's conjecture. [Citation Graph (, )][DBLP]
On canonical antichains. [Citation Graph (, )][DBLP]
Vertex pancyclicity in quasi-claw-free graphs. [Citation Graph (, )][DBLP]
An upper bound on the domination number of n-vertex connected cubic graphs. [Citation Graph (, )][DBLP]
(s, m)-radius of k-connected graphs. [Citation Graph (, )][DBLP]
Pancyclic graphs and linear forests. [Citation Graph (, )][DBLP]
The orientable genus of some joins of complete graphs with large edgeless graphs. [Citation Graph (, )][DBLP]
|