Packing non-zero \(A\)-paths in an undirected model of group labeled graphs (Q965242): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2009.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024891025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing non-zero \(A\)-paths in group-labelled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint \(A\)-paths in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Mader's \(\mathcal S\)-paths theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank

Latest revision as of 17:54, 2 July 2024

scientific article
Language Label Description Also known as
English
Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
scientific article

    Statements

    Packing non-zero \(A\)-paths in an undirected model of group labeled graphs (English)
    0 references
    0 references
    21 April 2010
    0 references
    group labeled graphs
    0 references
    disjoint paths
    0 references
    \(A\)-paths
    0 references

    Identifiers