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

DOI10.20429/TAG.2019.060204MaRDI QIDQ5205659zbMATH OpenOpenAlexFDO

Authors

Publication date 13 December 2019

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

co-NP problemforcibly biconnectedgraphical degree sequencegraphical partition

Mathematics Subject Classification ID

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

Recommendations

• An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
• Forcibly bipartite and acyclic (uni-)graphic sequences
• A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected
• scientific article; zbMATH DE number 2192215
• On forcibly connected graphic sequences
• An efficient algorithm to test potential bipartiteness of graphical degree sequences
• On degree sequences of undirected, directed, and bidirected graphs
• Enumeration of the degree sequences of non-separable graphs and connected graphs
• Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
• Extremal graph theory for degree sequences

Cited in

(4)

• Constructing a bipartite graph of maximum connectivity with prescribed degrees
• An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
• Rao's theorem for forcibly planar sequences revisited
• On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees.

This page was built for publication: Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results

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