Flows and parity subgraphs of graphs with large odd-edge-connectivity (Q444374): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jin-Long Shu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2012.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975146769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw‐decompositions and tutte‐orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double cycle covers and the petersen graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring-flow duality of embedded graphs / 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: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The circular flow number of a 6-edge connected graph is less than four / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (k,d)-colorings and fractional nowhere-zero flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows and generalized coloring theorems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807237 / 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: An equivalent version of the 3-flow conjecture / 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: Duality in graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 3-flows of highly connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circular flows of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of graphs with given circular flow numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 6-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular flow numbers of regular multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral decompositions of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Imbedding of Linear Graphs in Surfaces / 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: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular flows of nearly Eulerian graphs and vertex-splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering, community partition and disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number: A survey / rank
 
Normal rank

Latest revision as of 14:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Flows and parity subgraphs of graphs with large odd-edge-connectivity
scientific article

    Statements

    Flows and parity subgraphs of graphs with large odd-edge-connectivity (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    0 references
    integer flows
    0 references
    parity subgraph
    0 references
    odd-edge-connectivity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references