Balanced generic circuits without long paths (Q442309): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.disc.2012.03.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047964903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint Hamilton cycles in 4-regular planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative lengths of paths and cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Cycles in 3-Connected 3-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible circuit decompositions of 4‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness exponents of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairs of edge-disjoint Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in 3-connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles Intersecting Edge-Cuts of Prescribed Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs and rigidity of plane skeletal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness parameters of families of regular planar graphs in two or three types of faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717849 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 5 July 2024

scientific article
Language Label Description Also known as
English
Balanced generic circuits without long paths
scientific article

    Statements

    Balanced generic circuits without long paths (English)
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    generic circuits
    0 references
    Hamiltonian path
    0 references
    count matroid
    0 references
    0 references