Graph reductions, and techniques for finding minimal forbidden minors

1993 ◽  
pp. 591-600 ◽  
Author(s):  
Andrzej Proskurowski
Keyword(s):  
Graph Reductions ◽  
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 Control flow graphs and code coverage

2010 ◽  
Vol 20 (4) ◽  
pp. 739-749 ◽  
Author(s):  
Robert Gold
Keyword(s):  
Directed Graphs ◽  
Control Flow ◽  
Code Coverage ◽  
Branch Coverage ◽  
Formal Basis ◽  
Graph Reductions ◽  
Flow Graphs ◽  
Edge Coverage

Control flow graphs and code coverageThe control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced graphs and also about the paths in reduced graphs. Based on graphs, we define statement coverage and branch coverage such that coverage notions correspond to node coverage, and edge coverage, respectively.

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
Sign in / Sign up

Export Citation Format

Share Document