Jump to ContentJump to Main Navigation
Combinatorics, Complexity, and ChanceA Tribute to Dominic Welsh$
Users without a subscription are not able to see the full content.

Geoffrey Grimmett and Colin McDiarmid

Print publication date: 2007

Print ISBN-13: 9780198571278

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198571278.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 17 February 2019

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
DOI:10.1093/acprof:oso/9780198571278.003.0010

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 .