The following pages link to (Q4947393):
Displaying 50 items.
- Stanley-Reisner rings with large multiplicities are Cohen-Macaulay (Q855704) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- Heavy fans, cycles and paths in weighted graphs of large connectivity (Q861792) (← links)
- Network topology and the efficiency of equilibrium (Q863283) (← links)
- Short cycle connectivity (Q864116) (← links)
- Mobility of vertex-transitive graphs (Q864148) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- On a cycle through a specified linear forest of a graph (Q868359) (← links)
- On short paths through prescribed vertices of a graph (Q868361) (← links)
- Classes of cycle bases (Q868389) (← links)
- New exact values of the maximum size of graphs free of topological complete subgraphs (Q870962) (← links)
- On the number of matchings of a tree (Q875067) (← links)
- A constructive characterization of 3-connected triangle-free graphs (Q875938) (← links)
- Vertex-oblique graphs (Q878654) (← links)
- Achievable sets, brambles, and sparse treewidth obstructions (Q881587) (← links)
- There exist highly critically connected graphs of diameter three (Q882783) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Bipartite minors (Q896000) (← links)
- Signed graphs whose signed Colin de Verdière parameter is two (Q896009) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- On the structure and deficiency of \(k\)-trees with bounded degree (Q908291) (← links)
- Absolute algebraic connectivity of double brooms and trees (Q908315) (← links)
- A multiestimation-based scheme for modelling single-input-single-output discrete adaptive control systems (Q924731) (← links)
- Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs (Q925305) (← links)
- Three-connected graphs whose maximum nullity is at most three (Q929488) (← links)
- Graph powers and \(k\)-ordered hamiltonicity (Q932592) (← links)
- Friendship decompositions of graphs (Q932609) (← links)
- On planar and non-planar graphs having no chromatic zeros in the interval(1,2) (Q932643) (← links)
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs (Q932663) (← links)
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- On embeddability and stresses of graphs (Q950325) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Ring graphs and complete intersection toric ideals (Q960950) (← links)
- On dual power assignment optimization for biconnectivity (Q965816) (← links)
- Tree-width of graphs without a \(3\times 3\) grid minor (Q967302) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- Augmented nodal matrices and normal trees (Q968112) (← links)
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs (Q968420) (← links)
- Irreducible triangulations are small (Q974471) (← links)
- About acyclic edge colourings of planar graphs (Q975506) (← links)
- Perfect matchings with restricted intersection in cubic graphs (Q976153) (← links)
- Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension (Q982945) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Computing sharp 2-factors in claw-free graphs (Q988693) (← links)
- A one-round secure message broadcasting protocol through a key sharing tree (Q989505) (← links)
- Roughness in Cayley graphs (Q991887) (← links)
- Multiscale stochastic modeling for tractable inference and data assimilation (Q995308) (← links)
- A note on \(k\)-walks in bridgeless graphs (Q995769) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
