Gerlach, Tobias;
Harant, Jochen;
A note on domination in bipartite graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 2, S. 229-231
https://doi.org/10.7151/dmgt.1171
A note on domination in bipartite graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 2, S. 229-231
https://doi.org/10.7151/dmgt.1171
Göring, Frank;
A proof of Menger's theorem by contraction. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 111-112
https://doi.org/10.7151/dmgt.1161
A proof of Menger's theorem by contraction. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 111-112
https://doi.org/10.7151/dmgt.1161
Fowler, Patrick W.;
John, Peter E.;
Dürer polyhedra: the dark side of Melancholia. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 101-109
https://doi.org/10.7151/dmgt.1160
Dürer polyhedra: the dark side of Melancholia. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 101-109
https://doi.org/10.7151/dmgt.1160
Dobrynin, Andrey A.; Melnikov, Leonid S.; Schreyer, Jens; Walther, Hansjoachim
Some news about oblique graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 39-50
https://doi.org/10.7151/dmgt.1157
Some news about oblique graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 39-50
A k-gon alpha of a polyhedral graph G(V,E,F) is of type <b1,b2,...,bk> if the vertices incident with alpha in cyclic order have degrees b1, b2,...,bk and <b1,b2,...,bk>$ is the lexicographic minimum of all such sequences available for alpha. A polyhedral graph G is oblique if it has no two faces of the same type. Among others it is shown that an oblique graph contains vertices of degree 3.
https://doi.org/10.7151/dmgt.1157
Kostochka, Alexandr V.; Stiebitz, Michael;
A list version of Dirac's theorem on the number of edges in colour-critical graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 39 (2002), 3, S. 165-177
https://doi.org/10.1002/jgt.998
A list version of Dirac's theorem on the number of edges in colour-critical graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 39 (2002), 3, S. 165-177
https://doi.org/10.1002/jgt.998
Wagenknecht, Thomas;
Bifurcation of a reversible Hamiltonian system from a fixed point with fourfold eigenvalue zero. - In: Dynamical systems, ISSN 1468-9375, Bd. 17 (2002), 1, S. 29-44
http://dx.doi.org/10.1080/14689360110089831
Bifurcation of a reversible Hamiltonian system from a fixed point with fourfold eigenvalue zero. - In: Dynamical systems, ISSN 1468-9375, Bd. 17 (2002), 1, S. 29-44
http://dx.doi.org/10.1080/14689360110089831
Fabrici, Igor;
On vertex-degree restricted subgraphs in polyhedral graphs. - In: Discrete mathematics, Bd. 256 (2002), 1/2, S. 105-114
http://dx.doi.org/10.1016/S0012-365X(01)00368-5
On vertex-degree restricted subgraphs in polyhedral graphs. - In: Discrete mathematics, Bd. 256 (2002), 1/2, S. 105-114
http://dx.doi.org/10.1016/S0012-365X(01)00368-5
Brandt, Stephan;
A 4-colour problem for dense triangle-free graphs. - In: Discrete mathematics, Bd. 251 (2002), 1/3, S. 33-46
http://dx.doi.org/10.1016/S0012-365X(01)00340-5
A 4-colour problem for dense triangle-free graphs. - In: Discrete mathematics, Bd. 251 (2002), 1/3, S. 33-46
http://dx.doi.org/10.1016/S0012-365X(01)00340-5
Göring, Frank;
On 2-regular subgraphs in polyhedral graphs. - In: Discrete mathematics, Bd. 251 (2002), 1/3, S. 97-102
http://dx.doi.org/10.1016/S0012-365X(01)00329-6
On 2-regular subgraphs in polyhedral graphs. - In: Discrete mathematics, Bd. 251 (2002), 1/3, S. 97-102
http://dx.doi.org/10.1016/S0012-365X(01)00329-6
Voigt, Margit; Walther, Hansjoachim;
Polyhedral graphs with restricted number of faces of the same type. - In: Discrete mathematics, Bd. 244 (2002), 1/3, S. 473-478
http://dx.doi.org/10.1016/S0012-365X(01)00103-0
Polyhedral graphs with restricted number of faces of the same type. - In: Discrete mathematics, Bd. 244 (2002), 1/3, S. 473-478
http://dx.doi.org/10.1016/S0012-365X(01)00103-0