Minimal forbidden sets for degree sequence characterizations (Q2344782): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Forbidden subgraphs and the existence of a 2-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-switches and isomorphism classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-minimal degree-sequence-forcing triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes characterized both by forbidden subgraphs and degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden pairs for \(k\)-connected Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden triples implying Hamiltonicity: for all graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4177589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pair of forbidden subgraphs and perfect matchings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Graphs with Multiple Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden triples and traceability: A characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear recognition of pseudo-split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sequences of matrogenic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden triples for perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden induced subgraphs for perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroidal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colorability and forbidden subgraphs. I: Characterizing pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Once more on matrogenic graphs / rank
 
Normal rank

Latest revision as of 02:53, 10 July 2024

scientific article
Language Label Description Also known as
English
Minimal forbidden sets for degree sequence characterizations
scientific article

    Statements

    Minimal forbidden sets for degree sequence characterizations (English)
    0 references
    0 references
    0 references
    18 May 2015
    0 references
    degree-sequence-forcing set
    0 references
    forbidden subgraphs
    0 references
    degree sequence characterization
    0 references
    2-switch
    0 references
    0 references
    0 references

    Identifiers