Pages that link to "Item:Q3186815"
From MaRDI portal
The following pages link to On an extremal inverse problem in graph theory (Q3186815):
Displaying 11 items.
- On the graph condition regarding the \(F\)-inverse cover problem (Q309948) (← links)
- Maximal independent sets in the covering graph of the cube (Q385145) (← links)
- The inverse 1-maxian problem with edge length modification (Q941835) (← links)
- A generalized inverse for graphs with absorption (Q1675661) (← links)
- Bipartite graphs can have any number of independent sets (Q1823265) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- A Calderón type inverse problem for tree graphs (Q2134551) (← links)
- (Q4870825) (← links)
- Inverse Problems and Zero Forcing for Graphs (Q5039750) (← links)
- The set of all values of the domination number in trees with a given degree sequence (Q5090145) (← links)
- Inverse problems on graphs: recovering the tree of strings by the BC-method (Q5479016) (← links)