Recognizing hidden bicircular networks
From MaRDI portal
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38) Deterministic network models in operations research (90B10) Linear programming (90C05) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
Cites work
- An Almost Linear-Time Algorithm for Graph Realization
- An efficient PQ-graph algorithm for solving the graph-realization problem
- BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
- BICIRCULAR MATROIDS
- Connectivity in bicircular matroids
- Converting Linear Programs to Network Problems
- scientific article; zbMATH DE number 3965788 (Why is no real title available?)
- scientific article; zbMATH DE number 4010154 (Why is no real title available?)
- scientific article; zbMATH DE number 3679885 (Why is no real title available?)
- scientific article; zbMATH DE number 3791941 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- Matrix characterizations of circular-arc graphs
- On matroids on edge sets of graphs with connected subgraphs as circuits. II
- On subgraphs as matroid cells
- Recognizing a class of bicircular matroids
- Recognizing hidden bicircular networks
- Representations of bicircular matroids
- Signed graphs
- The structure of bases in bicircular matroids
Cited in
(4)
This page was built for publication: Recognizing hidden bicircular networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208462)