Removing Circuits in 3-Connected Binary Matroids

Discrete Mathematics - Netherlands
doi 10.1016/j.disc.2007.12.095
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Involutions of Connected Binary Matroids

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2000English

Graphic and Cographic Gamma-Extensions of Binary Matroids

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

The Binary Matroids With No 4-Wheel Minor

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1987English

Matroids, Delta-Matroids and Embedded Graphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

Dishonest Majority Multi-Party Computation for Binary Circuits

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Every 3-Connected, Locally Connected, Claw-Free Graph Is Hamilton-Connected

Journal of Graph Theory
GeometryTopology
1996English

Verification of Arithmetic Circuits Using Binary Moment Diagrams

International Journal on Software Tools for Technology Transfer
Information SystemsSoftware
2001English

Contractible Subgraphs in 3-Connected Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

Rough Subalgebras of Some Binary Algebras Connected With Logics

International Journal of Mathematics and Mathematical Sciences
Mathematics
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy