On Okada's method for realizing cut-set matrices
From MaRDI portal
Publication:2532129
DOI10.1016/0095-8956(71)90072-4zbMath0172.25801OpenAlexW1966503872MaRDI QIDQ2532129
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90072-4
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Solution to the realizability problem for irredundant Boolean branch- networks
- Matroids and Graphs
- Graphs and Vector Spaces
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Synthesis of Switching Functions by Linear Graph Theory
- From Matrices to Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Okada's method for realizing cut-set matrices
