Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Brown, William G.
1965.
A New Proof of a Theorem of Dirac.
Canadian Mathematical Bulletin,
Vol. 8,
Issue. 4,
p.
459.
1967.
Vol. 27,
Issue. ,
p.
249.
Mader, W.
1968.
Homomorphies�tze f�r Graphen.
Mathematische Annalen,
Vol. 178,
Issue. 2,
p.
154.
đình hòa, Vũ
1986.
Ein Struktursatz für 2‐fach zusammenhängende Graphen mit großer Minimalvalenz.
Mathematische Nachrichten,
Vol. 128,
Issue. 1,
p.
151.
Thomassen, C.
1987.
On digraphs with no two disjoint directed cycles.
Combinatorica,
Vol. 7,
Issue. 1,
p.
145.
1988.
Graph Theory in Memory of G.A. Dirac.
Vol. 41,
Issue. ,
p.
1.
Oxley, James G
1989.
The regular matroids with no 5-wheel minor.
Journal of Combinatorial Theory, Series B,
Vol. 46,
Issue. 3,
p.
292.
Sarkaria, K. S.
1991.
A one-dimensional Whitney trick and Kuratowski’s graph planarity criterion.
Israel Journal of Mathematics,
Vol. 73,
Issue. 1,
p.
79.
Hartvigsen, David
and
Mardon, Russell
1991.
The prism‐free planar graphs and their cycles bases.
Journal of Graph Theory,
Vol. 15,
Issue. 4,
p.
431.
Fonlupt, Jean
and
Naddef, Denis
1992.
The traveling salesman problem in graphs with some excluded minors.
Mathematical Programming,
Vol. 53,
Issue. 1-3,
p.
147.
Fonlupt, Jean
and
Nachef, Armand
1993.
Dynamic programming and the graphical traveling salesman problem.
Journal of the ACM,
Vol. 40,
Issue. 5,
p.
1165.
Lady, George M.
Lundy, Thomas J.
and
Maybee, John
1995.
Nearly sign-nonsingular matrices.
Linear Algebra and its Applications,
Vol. 220,
Issue. ,
p.
229.
Kingan, S.R.
1996.
Binary matroids without prisms, prism duals, and cubes.
Discrete Mathematics,
Vol. 152,
Issue. 1-3,
p.
211.
Barnette, D.W.
1998.
Contractible circuits in 3-connected graphs.
Discrete Mathematics,
Vol. 187,
Issue. 1-3,
p.
19.
Maharry, John
1999.
An excluded minor theorem for the octahedron.
Journal of Graph Theory,
Vol. 31,
Issue. 2,
p.
95.
Kingan, S.R.
1999.
Intersections of circuits and cocircuits in binary matroids.
Discrete Mathematics,
Vol. 195,
Issue. 1-3,
p.
157.
Maharry, John
2000.
A Characterization of Graphs with No Cube Minor.
Journal of Combinatorial Theory, Series B,
Vol. 80,
Issue. 2,
p.
179.
Chlebíková, Janka
2007.
A characterization of some graph classes using excluded minors.
Periodica Mathematica Hungarica,
Vol. 55,
Issue. 1,
p.
1.
Bang-Jensen, Jørgen
and
Kriesell, Matthias
2011.
On the problem of finding disjoint cycles and dicycles in a digraph.
Combinatorica,
Vol. 31,
Issue. 6,
p.
639.
Ding, Guoli
and
Liu, Cheng
2013.
Excluding a small minor.
Discrete Applied Mathematics,
Vol. 161,
Issue. 3,
p.
355.