Find subtrees of specified weight and cycles of specified length in linear time (Q6056757): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.22712 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3199315121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in 4-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some 4-valent, 3-connected, planar, almost pancyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in 4-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large cycles in Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of specific lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On planar graphs arbitrarily decomposable into closed trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5197596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3834063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton cycles in certain planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective planar graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability and edge choosability of planar graphs without five cycles / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JGT.22712 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:02, 30 December 2024

scientific article; zbMATH DE number 7745216
Language Label Description Also known as
English
Find subtrees of specified weight and cycles of specified length in linear time
scientific article; zbMATH DE number 7745216

    Statements

    Find subtrees of specified weight and cycles of specified length in linear time (English)
    0 references
    0 references
    4 October 2023
    0 references
    cycles in planar Hamiltonian graphs
    0 references
    subtree sums
    0 references

    Identifiers

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