- Title Pages
- Illustration
- PREFACE
- LIST OF CONTRIBUTORS
-
1 ORBIT COUNTING AND THE TUTTE POLYNOMIAL -
2 EULERIAN AND BIPARTITE ORIENTABLE MATROIDS -
3 TUTTE-WHITNEY POLYNOMIALS: SOME HISTORY AND GENERALIZATIONS -
4 A SURVEY ON THE USE OF MARKOV CHAINS TO RANDOMLY SAMPLE COLOURINGS -
5 TOWARDS A MATROID-MINOR STRUCTURE THEORY -
6 RANDOM PLANAR GRAPHS WITH GIVEN AVERAGE DEGREE -
7 FOURIER ANALYSIS ON FINITE ABELIAN GROUPS: SOME GRAPHICAL APPLICATIONS -
8 FLOWS AND FERROMAGNETS -
9 APPROXIMATING THE TUTTE POLYNOMIAL -
10 NON-SEPARATING CIRCUITS AND COCIRCUITS IN MATROIDS -
11 EXPANDING THE TUTTE POLYNOMIAL OF A MATROID OVER THE INDEPENDENT SETS -
12 CONNECTION MATRICES -
13 COMPLEXITY OF GRAPH POLYNOMIALS -
14 RANDOM PLANAR GRAPHS AND THE NUMBER OF PLANAR GRAPHS -
15 THE CONTRIBUTIONS OF DOMINIC WELSH TO MATROID THEORY -
16 ON THE UNKNOTTING PROBLEM -
17 ADVANCES ON THE ERDŐS–FABER–LOVÁSZ CONJECTURE -
18 STOCHASTIC SET-BACKS - Index
NON-SEPARATING CIRCUITS AND COCIRCUITS IN MATROIDS
NON-SEPARATING CIRCUITS AND COCIRCUITS IN MATROIDS
- Chapter:
- (p.162) 10 NON-SEPARATING CIRCUITS AND COCIRCUITS IN MATROIDS
- Source:
- Combinatorics, Complexity, and Chance
- Author(s):
Bráulio Maia Junior
Manoel Lemos
Tereza R. B. Melo
- Publisher:
- Oxford University Press
This chapter surveys results about non-separating circuits and cocircuits in graphs and matroids. Some conjectures and open problems are presented.
Keywords: non-separating circuits, cocircuits, matroids
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .
- Title Pages
- Illustration
- PREFACE
- LIST OF CONTRIBUTORS
-
1 ORBIT COUNTING AND THE TUTTE POLYNOMIAL -
2 EULERIAN AND BIPARTITE ORIENTABLE MATROIDS -
3 TUTTE-WHITNEY POLYNOMIALS: SOME HISTORY AND GENERALIZATIONS -
4 A SURVEY ON THE USE OF MARKOV CHAINS TO RANDOMLY SAMPLE COLOURINGS -
5 TOWARDS A MATROID-MINOR STRUCTURE THEORY -
6 RANDOM PLANAR GRAPHS WITH GIVEN AVERAGE DEGREE -
7 FOURIER ANALYSIS ON FINITE ABELIAN GROUPS: SOME GRAPHICAL APPLICATIONS -
8 FLOWS AND FERROMAGNETS -
9 APPROXIMATING THE TUTTE POLYNOMIAL -
10 NON-SEPARATING CIRCUITS AND COCIRCUITS IN MATROIDS -
11 EXPANDING THE TUTTE POLYNOMIAL OF A MATROID OVER THE INDEPENDENT SETS -
12 CONNECTION MATRICES -
13 COMPLEXITY OF GRAPH POLYNOMIALS -
14 RANDOM PLANAR GRAPHS AND THE NUMBER OF PLANAR GRAPHS -
15 THE CONTRIBUTIONS OF DOMINIC WELSH TO MATROID THEORY -
16 ON THE UNKNOTTING PROBLEM -
17 ADVANCES ON THE ERDŐS–FABER–LOVÁSZ CONJECTURE -
18 STOCHASTIC SET-BACKS - Index
