|
Journals in DBLP
Preface. [Citation Graph (, )][DBLP]
What is on his mind? [Citation Graph (, )][DBLP]
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. [Citation Graph (, )][DBLP]
Strong embeddings of minimum genus. [Citation Graph (, )][DBLP]
Degree-associated reconstruction number of graphs. [Citation Graph (, )][DBLP]
A note on balanced bipartitions. [Citation Graph (, )][DBLP]
Distance-restricted matching extension in planar triangulations. [Citation Graph (, )][DBLP]
Dense graphs have K3, t minors. [Citation Graph (, )][DBLP]
A note on traversing specified vertices in graphs embedded with large representativity. [Citation Graph (, )][DBLP]
Hadwiger numbers and over-dominating colourings. [Citation Graph (, )][DBLP]
Approximation algorithms for the minimum rainbow subgraph problem. [Citation Graph (, )][DBLP]
Openly disjoint circuits through a vertex in regular digraphs. [Citation Graph (, )][DBLP]
The complexity of colouring by locally semicomplete digraphs. [Citation Graph (, )][DBLP]
The complexity of locally injective homomorphisms. [Citation Graph (, )][DBLP]
Monochromatic sinks in nearly transitive arc-colored tournaments. [Citation Graph (, )][DBLP]
Homomorphisms from sparse graphs to the Petersen graph. [Citation Graph (, )][DBLP]
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs. [Citation Graph (, )][DBLP]
The thickness and chromatic number of r-inflated graphs. [Citation Graph (, )][DBLP]
Cyclability in k-connected K1, 4-free graphs. [Citation Graph (, )][DBLP]
Maximum independent sets in 3- and 4-regular Hamiltonian graphs. [Citation Graph (, )][DBLP]
Locally finite graphs with ends: A topological approach, II. Applications. [Citation Graph (, )][DBLP]
A note on generalized pentagons. [Citation Graph (, )][DBLP]
|