Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 4008429

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

zbMATH Open0622.05036MaRDI QIDQ3758862FDOQ3758862


Authors: R. C. Entringer, Lane Clark Edit this on Wikidata


Publication date: 1985



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 140143
  • On the minimum number of spanning trees in cubic multigraphs
  • Spanning trees in subcubic graphs.
  • Spanning trees with many leaves in cubic graphs
  • Cubic graphs with minimum number of spanning trees.


zbMATH Keywords

cubic graphspanning tree


Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)



Cited In (10)

  • The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
  • Spanning cubic graph designs
  • Cubic graphs with minimum number of spanning trees.
  • Spanning trees in subcubic graphs.
  • Number of vertices of degree three in spanning 3-trees in square graphs
  • 3-trees with few vertices of degree 3 in circuit graphs
  • Title not available (Why is that?)
  • A planar \(3\)-connected, \(3\)-regular graph without spanning \(Y\)-trees
  • Toughness, minimum degree, and spanning cubic subgraphs
  • Arbres avec un nombre maximum de sommets pendants





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758862)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3758862&oldid=17292885"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 11:43. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki