Realizing graphs with cut constraints

DOI10.1007/978-3-031-92932-8_21MaRDI QIDQ6902185zbMATH OpenFDO

Authors Vítor Gomes Chagas, Samuel Plaça de Paula, Greis Yvet Oropeza Quesquén, Lucas de Oliveira Silva, Uéverton dos Santos Souza

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92932-8_21

zbMATH Keywords

degree sequencegraph factorgraph realization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A remark on the existence of finite graphs
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• A simple criterion on degree sequences of graphs
• A simple proof of the Erdos-Gallai theorem on graph sequences
• An algorithmic proof of Tutte's f-factor theorem
• Constructing uniquely realizable graphs
• Cut query algorithms with star contraction
• Degree sequences of multigraphs
• Factors and factorizations of graphs—a survey
• Graph factors and factorization: 1985--2003: a survey
• Graph realizations constrained by skeleton graphs
• Graphic sequences of trees and a problem of Frobenius
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3743297 (Why is no real title available?)
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Learning spanning forests optimally in weighted undirected graphs with CUT queries
• Not all simple looking degree sequence problems are easy
• On forcibly hereditary P-graphical sequences
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On realizing a single degree sequence by a bipartite graph
• On vertex-weighted realizations of acyclic and general graphs
• Realizability and uniqueness in graphs
• Recognition of split-graphic sequences
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Sequences with a unique realization by simple graphs
• Subgraphs with prescribed valencies
• Submodular function minimization
• Sufficient conditions for graphicality of bidegree sequences
• The Factors of Graphs
• The splittance of a graph
• The theory of regular graphs
• Vertex-weighted realizations of graphs

This page was built for publication: Realizing graphs with cut constraints

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