Pages that link to "Item:Q3075196"
From MaRDI portal
The following pages link to Minimum semidefinite rank of outerplanar graphs and the tree cover number (Q3075196):
Displaying 18 items.
- Minimum rank of outerplanar graphs (Q417506) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs (Q649553) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC (Q2185850) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- On the tree cover number of a graph (Q2357664) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees (Q3166848) (← links)
- Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)
- A New Lower Bound for Positive Zero Forcing (Q4632220) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- Tree cover number and maximum semidefinite nullity of some graph classes (Q5139648) (← links)
- Graph complement conjecture for classes of shadow graphs (Q5862842) (← links)
- An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)
- Chordal graphs and distinguishability of quantum product states (Q6541336) (← links)
- Induced tree covering and the generalized Yutsis property (Q6547951) (← links)
- Tree covers of graphs and their linear preservers (Q6625086) (← links)
