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

scientific article; zbMATH DE number 4200248

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

zbMATH Open0727.05044MaRDI QIDQ3348938FDOQ3348938


Authors: David Billington Edit this on Wikidata


Publication date: 1988



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



Recommendations

  • scientific article; zbMATH DE number 553900
  • Properties of unique degree sequences of 3-uniform hypergraphs
  • On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
  • New sufficient conditions on the degree sequences of uniform hypergraphs
  • New results on degree sequences of uniform hypergraphs


zbMATH Keywords

degree sequence3-uniform hypergraph


Mathematics Subject Classification ID

Hypergraphs (05C65)



Cited In (11)

  • Numerical characterization of \(n\)-cube subset partitioning
  • New results on degree sequences of uniform hypergraphs
  • On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
  • Realizing degree sequences as \(Z_3\)-connected graphs
  • On 3-hypergraphs with equal degree sequences.
  • Optimization over degree sequences of graphs
  • Graphs and degree sequences: A survey. III
  • Numerical characterisation of n-cube subset partitioning
  • Optimization over Degree Sequences
  • Title not available (Why is that?)
  • Title not available (Why is that?)





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 Q3348938)

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