Dense on-line arbitrarily partitionable graphs (Q2357776): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Decomposable trees: A polynomial algorithm for tripodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shape of decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5413912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning powers of traceable or Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully decomposable split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line arbitrarily vertex decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5481324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense arbitrarily partitionable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrarily vertex decomposable suns with few rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line arbitrarily vertex decomposable suns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved degree conditions for Hamiltonian properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the circumference of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type condition for arbitrarily vertex decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing trees with large diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal circuits of graphs. I / rank
 
Normal rank

Revision as of 23:04, 13 July 2024

scientific article
Language Label Description Also known as
English
Dense on-line arbitrarily partitionable graphs
scientific article

    Statements

    Dense on-line arbitrarily partitionable graphs (English)
    0 references
    0 references
    14 June 2017
    0 references
    partitions of graphs
    0 references
    traceable graph
    0 references
    Erdős-Gallai condition
    0 references
    Ore condition
    0 references
    perfect matching
    0 references

    Identifiers