The following pages link to (Q5315023):
Displayed 50 items.
- Maximum vertex and face degree of oblique graphs (Q1044926) (← links)
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs (Q1045015) (← links)
- A proof of the rooted tree alternative conjecture (Q1045086) (← links)
- Submodular partition functions (Q1045090) (← links)
- A short proof of Fleischner's theorem (Q1045203) (← links)
- Weak similarities of finite ultrametric and semimetric spaces (Q1616628) (← links)
- On dynamic network security: a random decentering algorithm on graphs (Q1617065) (← links)
- Robust dependence modeling for high-dimensional covariance matrices with financial applications (Q1624844) (← links)
- Structure modeling and estimation of multiple resolvable group targets via graph theory and multi-Bernoulli filter (Q1640273) (← links)
- On a class of vertices of the core (Q1651303) (← links)
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
- Countable Menger's theorem with finitary matroid constraints on the ingoing edges (Q1658749) (← links)
- Dynamical systems associated with adjacency matrices (Q1671128) (← links)
- Highly arc-transitive digraphs -- structure and counterexamples (Q1677569) (← links)
- On the eigenvalues of weighted directed graphs (Q1682254) (← links)
- On the complexity of computing MP distance between binary phylogenetic trees (Q1682616) (← links)
- Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\) (Q1682895) (← links)
- Contractible edges in \(k\)-connected infinite graphs (Q1684943) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Degree sequences and edge connectivity (Q1688269) (← links)
- Fibonacci and telephone numbers in extremal trees (Q1692635) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph (Q1696548) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- The Bradley-Terry condition is \(L_1\)-testable (Q1699573) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
- Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences (Q1704899) (← links)
- Expected distance based on random walks (Q1708510) (← links)
- Multiple multivariate subdivision schemes: matrix and operator approaches (Q1713109) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Pfaffian polyominos on the Klein bottle (Q1713983) (← links)
- Complete colorings of planar graphs (Q1727729) (← links)
- An axiomatization of the Choquet integral in the context of multiple criteria decision making without any commensurability assumption (Q1730570) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs (Q1733857) (← links)
- Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
- The critical exponent: a novel graph invariant (Q1745162) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- On the generalized Wiener polarity index of trees with a given diameter (Q1752469) (← links)
- Clique trees of infinite locally finite chordal graphs (Q1753106) (← links)
- Edge reconstruction of the Ihara zeta function (Q1753114) (← links)
- Constructing goal-minimally \(k\)-diametric graphs by lifts (Q1759397) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)