Forcibly bipartite and acyclic (uni-)graphic sequences
From MaRDI portal
Publication:6041871
DOI10.1016/j.disc.2023.113460zbMath1514.05171MaRDI QIDQ6041871
Dror Rawitz, Toni Böhnlein, Amotz Bar-Noy, David Peleg
Publication date: 15 May 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rao's degree sequence conjecture
- Non-minimal degree-sequence-forcing triples
- Degree sequences of matrogenic graphs
- The splittance of a graph
- On forcibly connected graphic sequences
- Pairs of sequences with a unique realization by bipartite graphs
- Sequences with a unique realization by simple graphs
- Graphic sequences with unique realization
- Characterization of self-complementary graphs with 2-factors
- Solution of the Hamiltonian problem for self-complementary graphs
- Decomposition of graphical sequences and unigraphs
- On forcibly hereditary P-graphical sequences
- Minimal forbidden sets for degree sequence characterizations
- On factorable degree sequences
- Algorithms for constructing graphs and digraphs with given valences and factors
- A remark on the existence of finite graphs
- Box-threshold graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Threshold Sequences
- A Note on Unigraphic Sequences
- Graph classes characterized both by forbidden subgraphs and degree sequences
- Existence of k-edge connected ordinary graphs with prescribed degrees
This page was built for publication: Forcibly bipartite and acyclic (uni-)graphic sequences
