Realizing degree sequences as \(Z_3\)-connected graphs (Q400414): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 7 users not shown)
Property / author
 
Property / author: Fan Yang / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147279753 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1407.3531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sequence and supereulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 3-flows in triangularly connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for constructing graphs and digraphs with given valences and factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group connectivity of 3-edge-connected chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group connectivity and group colorings of graphs --- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-condition and \(Z_3\)-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem on group connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest degree sum that yields graphic sequences with a \(Z_3\)-connected realization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:57, 8 July 2024

scientific article
Language Label Description Also known as
English
Realizing degree sequences as \(Z_3\)-connected graphs
scientific article

    Statements

    Realizing degree sequences as \(Z_3\)-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2014
    0 references
    nowhere-zero 3-flow
    0 references
    \(Z_3\)-connectivity
    0 references
    degree sequence
    0 references

    Identifiers