Dense arbitrarily partitionable graphs (Q907823): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.7151/dmgt.1833 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Decomposable trees: A polynomial algorithm for tripodes / 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: On the structure of arbitrarily partitionable graphs with given connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively arbitrarily vertex-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively arbitrarily vertex-decomposable suns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal arbitrarily partitionable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Dense arbitrarily vertex decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5481324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line arbitrarily vertex decomposable trees / 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: Q5443779 / 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: Maximal circuits of graphs. I / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7151/DMGT.1833 / rank
 
Normal rank

Latest revision as of 08:11, 10 December 2024

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

    Statements

    Dense arbitrarily partitionable graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 January 2016
    0 references
    arbitrarily partitionable graph
    0 references
    Erdős-Gallai condition
    0 references
    traceable graph
    0 references
    perfect matching
    0 references

    Identifiers