Antisymmetric flows and strong colourings of oriented graphs (Q1296157): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q105856728, #quickstatements; #temporary_batch_1714653913616
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Homomorphisms of edge-colored graphs and Coxeter groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows, view obstructions, and the lonely runner / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum average degree and the oriented chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal graphs for planar oriented graphs of a given girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero integral flows on a bidirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 2 / 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: Flows and generalized coloring theorems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero integral chains and flows in bidirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Coloring and Recursive Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic and oriented chromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and girth of oriented planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colored homomorphisms of colored mixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good and semi-strong colorings of oriented planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 6-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of oriented graphs / 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: A Class Of Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332881 / rank
 
Normal rank

Revision as of 20:20, 28 May 2024

scientific article
Language Label Description Also known as
English
Antisymmetric flows and strong colourings of oriented graphs
scientific article

    Statements

    Antisymmetric flows and strong colourings of oriented graphs (English)
    0 references
    0 references
    0 references
    12 July 1999
    0 references
    Let \(M\) be an abelian group with additive notation, and \(B\subset M\), \(0\notin B\), \(B\cap -B=\varnothing \). For an oriented graph \(G=(V,E),\) the authors define an \(M\)-antisymmetric flow to be a mapping \(\phi \) from \(E\) to \(B\) so that, for any \(S\subset V\), \[ \sum_{e\in S^{+}}\phi (e)-\sum_{e\in S^{-}}\phi (e)=0, \] where \(S^{+}\) is the set of edges which begin in \(S\) and terminate not in \(S, \) and \(S^{-}=(V\backslash S)^{+}.\) It is shown that an antisymmetric flow exists for any oriented graph without oriented 2-cut and that any planar graph has an orientation with a \((Z_6)^5\)-antisymmetric flow.
    0 references
    flows
    0 references
    colorings
    0 references
    digraphs
    0 references
    abelian group
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references