104
Voted
DM
2010
15 years 1 months ago
2010
We characterize all internally 4-connected binary matroids M with the property that the ground set of M can be ordered (e0, . . . , en-1) in such a way that {ei, . . . , ei+t} is 4...
128
Voted
DM
2010
15 years 1 months ago
2010
: The main purpose of the paper is to develop an approach to the evaluation or the estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate th...
67
Voted
DM
2010
15 years 1 months ago
2010
In 1977, Ganter and Teirlinck proved that any 2t
DM
2010
15 years 1 months ago
2010
90
Voted
DM
2010
15 years 1 months ago
2010
For a graph G let
100
Voted
DM
2010
15 years 1 months ago
2010
Abstract: Duality and chirality are examples of operations of order 2 on hypermaps. James showed that the groups of all operations on hypermaps and on oriented hypermaps can be ide...
77
Voted
DM
2010
15 years 1 months ago
2010
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...
82
Voted
DM
2010
15 years 1 months ago
2010
92
Voted
DM
2010
15 years 1 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
63
Voted
DM
2010
15 years 1 months ago
2010