Graphic sequences with an A-connected realization
From MaRDI portal
Publication:489330
DOI10.1007/S00373-013-1363-3zbMATH Open1306.05134OpenAlexW1970749935MaRDI QIDQ489330FDOQ489330
Authors: Rong Luo, Guodong Guo, Jian-Hua Yin 
Publication date: 20 January 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1363-3
Recommendations
- A complete characterization of graphic sequences with a \(Z_3\)-connected realization
- scientific article; zbMATH DE number 5734066
- Graphic sequences with a realization containing a complete multipartite subgraph
- On forcibly connected graphic sequences
- A remark concerning graphical sequences
- Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \)
- scientific article; zbMATH DE number 4187870
- On potentially \(A_{r,s}\)-graphic sequences
- The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
- Graphic sequences with a realization containing a generalized friendship graph
Cites Work
- Graph theory with applications
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- The smallest degree sum that yields graphic sequences with a \(Z_3\)-connected realization
- Group connectivity and group colorings of graphs --- a survey
- Algorithms for constructing graphs and digraphs with given valences and factors
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
- An extremal problem on group connectivity of graphs
Cited In (9)
- Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
- The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization
- An extremal problem on bigraphic pairs with an \(A\)-connected realization
- A complete characterization of graphic sequences with a \(Z_3\)-connected realization
- Bigraphic pairs with an \(A\)-connected realization
- The smallest degree sum that yields graphic sequences with a \(Z_3\)-connected realization
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- Graphic Sequences Have Realizations Containing Bisections of Large Degree
- Title not available (Why is that?)
This page was built for publication: Graphic sequences with an \(A\)-connected realization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489330)
