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

Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results

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

DOI10.20429/tag.2019.060204zbMath1429.05194OpenAlexW2981495011MaRDI QIDQ5205659

No author found.

Publication date: 13 December 2019

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20429/tag.2019.060204


zbMATH Keywords

graphical partitiongraphical degree sequenceco-NP problemforcibly biconnected


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)





Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5205659&oldid=19804297"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 18:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki