Forcibly bipartite and acyclic (uni-)graphic sequences
From MaRDI portal
Publication:6041871
DOI10.1016/J.DISC.2023.113460zbMATH Open1514.05171MaRDI QIDQ6041871FDOQ6041871
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)
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cites Work
- Title not available (Why is that?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Decomposition of graphical sequences and unigraphs
- Algorithms for constructing graphs and digraphs with given valences and factors
- A remark on the existence of finite graphs
- Title not available (Why is that?)
- Rao's degree sequence conjecture
- Degree sequences of matrogenic graphs
- The splittance of a graph
- A Note on Unigraphic Sequences
- Graph classes characterized both by forbidden subgraphs and degree sequences
- Pairs of sequences with a unique realization by bipartite graphs
- Sequences with a unique realization by simple graphs
- Graphic sequences with unique realization
- Box-threshold graphs
- Non-minimal degree-sequence-forcing triples
- Existence of k-edge connected ordinary graphs with prescribed degrees
- Title not available (Why is that?)
- Threshold Sequences
- Minimal forbidden sets for degree sequence characterizations
- On forcibly connected graphic sequences
- On factorable degree sequences
- Title not available (Why is that?)
- Solution of the Hamiltonian problem for self-complementary graphs
- Characterization of self-complementary graphs with 2-factors
- On forcibly hereditary P-graphical sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Title not available (Why is that?)
- On fractional realizations of graph degree sequences
- A note on graphic sequences with no realization containing an induced four cycle
- Solution to a forcible version of a graphic sequence problem
- Adjacency relationships forced by a degree sequence
- Title not available (Why is that?)
- Graph classes characterized both by forbidden subgraphs and degree sequences
- On the faces of unigraphic 3-polytopes
- Minimal forbidden sets for degree sequence characterizations
- Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results
- An Efficient Algorithm to Test Forcibly-connectedness of Graphical 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)
