Handle bases and bounds on the number of subgraphs
From MaRDI portal
Publication:1087883
DOI10.1016/0095-8956(87)90058-XzbMath0612.05035OpenAlexW2032045362MaRDI QIDQ1087883
Publication date: 1987
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(87)90058-x
Determinants, permanents, traces, other special matrix functions (15A15) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Cell rotation graphs of strongly connected orientations of plane graphs with an application ⋮ Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents
Cites Work
- Unnamed Item
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
- On minimal elementary bipartite graphs
- The diagonal equivalence of a nonnegative matrix to a stochastic matrix
- Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal
- An Upper Bound for the Permanent of a Fully Indecomposable Matrix
This page was built for publication: Handle bases and bounds on the number of subgraphs
