The following pages link to J. M. S. Simões-Pereira (Q910417):
Displayed 50 items.
- An algorithm and its role in the study of optimal graph realizations of distance matrices (Q910418) (← links)
- Underlying graph and total length of optimal realizations of variable distance matrices (Q1095929) (← links)
- A note on distance matrices with unicyclic graph realizations (Q1121283) (← links)
- Erdős-Hajnal well-orderings and n-degenerate graphs (Q1143403) (← links)
- (Q1163033) (redirect page) (← links)
- Submatrices of non-tree-realizable distance matrices (Q1163034) (← links)
- On matroids on edge sets of graphs with connected subgraphs as circuits. II (Q1217718) (← links)
- Subgraphs as circuits and bases of matroids (Q1217719) (← links)
- Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs (Q1229733) (← links)
- Just two total graphs are complementary (Q1233031) (← links)
- A note on finite topologies and switching functions (Q1247947) (← links)
- A note on completing quasi-distance and distance matrices (Q2302875) (← links)
- A note on the cycle multiplicity of line-graphs and total graphs (Q2544592) (← links)
- Connectivity, line-connectivity and J-conntection of the total graph (Q2546519) (← links)
- On subgraphs as matroid cells (Q2548961) (← links)
- A note on graphs with prescribed clique and point-partition numbers (Q2553978) (← links)
- A note on convexity and submatrices of distance matrices (Q3029037) (← links)
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices (Q3320428) (← links)
- (Q3402298) (← links)
- (Q3472121) (← links)
- An algorithm for tree-realizability of distance matrices<sup>∗</sup> (Q3477951) (← links)
- An Optimality Criterion for Graph Embeddings of Metrics (Q3808120) (← links)
- (Q3855205) (← links)
- (Q4012030) (← links)
- (Q4063188) (← links)
- (Q4065589) (← links)
- Boolean Permanents, Permutation Graphs and Products (Q4078060) (← links)
- (Q4097334) (← links)
- (Q4106245) (← links)
- (Q4143328) (← links)
- Locally k-degenerate graphs: a definition and two conjectures. (Q4143342) (← links)
- (Q4182795) (← links)
- (Q4198527) (← links)
- WHAT IS...a Matroidal Family of Graphs? (Q4553334) (← links)
- (Q4583839) (← links)
- (Q4915818) (← links)
- (Q5203045) (← links)
- (Q5212295) (← links)
- (Q5339423) (← links)
- (Q5418680) (← links)
- (Q5418681) (← links)
- (Q5513319) (← links)
- On the Boolean Matrix Equation M <sup>′</sup> =ν <sub>i=1</sub> M <sup>i</sup> (Q5520650) (← links)
- (Q5536556) (← links)
- A note on the tree realizability of a distance matrix (Q5567012) (← links)
- (Q5588445) (← links)
- (Q5625219) (← links)
- (Q5650417) (← links)
- On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits (Q5680160) (← links)
- (Q5738007) (← links)