scholarly journals Forbidden Minors: Finding the Finite Few

2017 ◽  
pp. 85-97
Author(s):  
Thomas W. Mattman
Keyword(s):  
Forbidden Minors

scholarly journals On forbidden minors for ${\rm GF}(3)$

1988 ◽  
Vol 102 (2) ◽  
pp. 437-437
Author(s):  
Jeff Kahn ◽  
Paul Seymour
Keyword(s):  
Forbidden Minors

scholarly journals Uniform Kernelization Complexity of Hitting Forbidden Minors

2015 ◽  
pp. 629-641 ◽  
Author(s):  
Archontia C. Giannopoulou ◽  
Bart M. P. Jansen ◽  
Daniel Lokshtanov ◽  
Saket Saurabh
Keyword(s):  
Forbidden Minors

scholarly journals Hitting Forbidden Minors: Approximation and Kernelization

2016 ◽  
Vol 30 (1) ◽  
pp. 383-410 ◽  
Author(s):  
Fedor V. Fomin ◽  
Daniel Lokshtanov ◽  
Neeldhara Misra ◽  
Geevarghese Philip ◽  
Saket Saurabh
Keyword(s):  
Forbidden Minors

scholarly journals Forbidden minors for the class of graphs G with ξ(G)⩽2

2007 ◽  
Vol 423 (1) ◽  
pp. 42-52 ◽  
Author(s):  
Leslie Hogben ◽  
Hein van der Holst
Keyword(s):  
Forbidden Minors

Forbidden-minors for es-splitting binary gammoids

2012 ◽  
Vol 33 (1) ◽  
pp. 33-38
Author(s):  
S. B. Dhotre ◽  
M. M. Shikare
Keyword(s):  
Forbidden Minors

scholarly journals THEOREMS OF POINTS AND PLANES IN THREE-DIMENSIONAL PROJECTIVE SPACE

2010 ◽  
Vol 88 (1) ◽  
pp. 75-92 ◽  
Author(s):  
DAVID G. GLYNN
Keyword(s):  
Graph Theory ◽  
Projective Space ◽  
Search Algorithm ◽  
Three Dimensional ◽  
Point Configuration ◽  
Graph Theoretic ◽  
Dimensional Projective Space ◽  
Forbidden Minors

AbstractWe discuss n4 configurations of n points and n planes in three-dimensional projective space. These have four points on each plane, and four planes through each point. When the last of the 4n incidences between points and planes happens as a consequence of the preceding 4n−1 the configuration is called a ‘theorem’. Using a graph-theoretic search algorithm we find that there are two 84 and one 94 ‘theorems’. One of these 84 ‘theorems’ was already found by Möbius in 1828, while the 94 ‘theorem’ is related to Desargues’ ten-point configuration. We prove these ‘theorems’ by various methods, and connect them with other questions, such as forbidden minors in graph theory, and sets of electrons that are energy minimal.

Forbidden minors for wye-delta-wye reducibility

2004 ◽  
Vol 47 (4) ◽  
pp. 317-321 ◽  
Author(s):  
Yaming Yu
Keyword(s):  
Forbidden Minors
Sign in / Sign up

Export Citation Format

Share Document