Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2853189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genus of alternating link types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genera of the alternating links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734775 / 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: Bounds of the number of disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERA OF THE LINKS DERIVED FROM 2-CONNECTED PLANE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the genus of the alternating knot. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state numbers of a virtual knot / 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: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über das Geschlecht von Knoten / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good algorithm for edge-disjoint branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and depth-first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spanning tree expansion of the Jones polynomial / 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: An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees / rank
 
Normal rank

Latest revision as of 16:23, 15 July 2024

scientific article
Language Label Description Also known as
English
Edge-disjoint spanning trees and the number of maximum state circles of a graph
scientific article

    Statements

    Edge-disjoint spanning trees and the number of maximum state circles of a graph (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    spanning trees
    0 references
    polynomial-time algorithm
    0 references
    state circle
    0 references
    link
    0 references

    Identifiers