Dense arbitrarily vertex decomposable graphs (Q1928285): 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: A degree bound on decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrarily vertex decomposable caterpillars with four or five leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: On arbitrarily vertex decomposable trees / 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: A lower bound for the circumference of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homology theory for spanning tress of a graph / 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: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722819 / rank
 
Normal rank

Latest revision as of 01:00, 6 July 2024

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

    Statements

    Dense arbitrarily vertex decomposable graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 January 2013
    0 references
    arbitrarily vertex decomposable graph
    0 references
    traceable graph
    0 references
    independence number
    0 references
    perfect matching
    0 references

    Identifiers

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