Forcibly bipartite and acyclic (uni-)graphic sequences

DOI10.1016/J.DISC.2023.113460MaRDI QIDQ6041871zbMATHFDO

Authors Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz

Publication date 15 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

degree sequencebipartite graphsgraph realizationacyclic graphsforcibly P-graphicunique P-graphic

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 932614
• Graph classes characterized both by forbidden subgraphs and degree sequences
• scientific article; zbMATH DE number 2192215
• On forcibly connected graphic sequences
• A simple criterion on degree sequences of graphs

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3811626 (Why is no real title available?)
• scientific article; zbMATH DE number 3743297 (Why is no real title available?)
• scientific article; zbMATH DE number 3754758 (Why is no real title available?)
• scientific article; zbMATH DE number 3756527 (Why is no real title available?)
• scientific article; zbMATH DE number 3563181 (Why is no real title available?)
• scientific article; zbMATH DE number 2188455 (Why is no real title available?)
• A Note on Unigraphic Sequences
• A remark on the existence of finite graphs
• Algorithms for constructing graphs and digraphs with given valences and factors
• Box-threshold graphs
• Characterization of self-complementary graphs with 2-factors
• Decomposition of graphical sequences and unigraphs
• Degree sequences of matrogenic graphs
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Graph classes characterized both by forbidden subgraphs and degree sequences
• Graphic sequences with unique realization
• Minimal forbidden sets for degree sequence characterizations
• Non-minimal degree-sequence-forcing triples
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On factorable degree sequences
• On forcibly connected graphic sequences
• On forcibly hereditary P-graphical sequences
• Pairs of sequences with a unique realization by bipartite graphs
• Rao's degree sequence conjecture
• Sequences with a unique realization by simple graphs
• Solution of the Hamiltonian problem for self-complementary graphs
• The splittance of a graph
• Threshold Sequences

Cited in

(12)

• Rao's theorem for forcibly planar sequences revisited
• Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results
• Solution to a forcible version of a graphic sequence problem
• Adjacency relationships forced by a degree sequence
• An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
• On the faces of unigraphic 3-polytopes
• On fractional realizations of graph degree sequences
• scientific article; zbMATH DE number 2192215 (Why is no real title available?)
• scientific article; zbMATH DE number 3922708 (Why is no real title available?)
• A note on graphic sequences with no realization containing an induced four cycle
• Minimal forbidden sets for degree sequence characterizations
• Graph classes characterized both by forbidden subgraphs and degree sequences

This page was built for publication: Forcibly bipartite and acyclic (uni-)graphic sequences

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