Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graded sparse graphs and body-length-direction frameworks

From MaRDI portal
Publication:2255800
Jump to:navigation, search

DOI10.1016/j.ejc.2014.10.010zbMath1307.05129OpenAlexW2058274139MaRDI QIDQ2255800

Viet Hang Nguyen, Bill Jackson

Publication date: 18 February 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.10.010


zbMATH Keywords

spanning subgraphsgraded pseudoforests


Mathematics Subject Classification ID

Density (toughness, etc.) (05C42)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A proof of the molecular conjecture
  • The generic rank of body-bar-and-hinge frameworks
  • Sparsity-certifying graph decompositions
  • Matroid theory and its applications in electric network theory and in statics
  • On graphs and rigidity of plane skeletal structures
  • Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures
  • Edge-Disjoint Spanning Trees of Finite Graphs
  • Matroids of gain graphs in applied discrete geometry
  • The Union of Matroids and the Rigidity of Frameworks
  • Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths
  • Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
  • Decomposition of Finite Graphs Into Forests
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2255800&oldid=14809099"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 09:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki