Removable and forced subgraphs of graphs (Q6495257): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Removal of subgraphs and perfect matchings in graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of dissimilar pfaffian orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some structural properties of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isolated-pentagon rule and nice substructures in fullerenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pólya's permanent problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ear decomposition and induced even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Progress in Matching Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly matchable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of cycle-forced bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On<i>k</i>-Resonant Fullerene Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note onn-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Factors and Matching Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even cycles and perfect matchings in claw-free plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PM-compact graphs and vertex-deleted subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycle-nice claw-free graphs / rank
 
Normal rank

Revision as of 14:33, 3 December 2024

scientific article; zbMATH DE number 7840906
Language Label Description Also known as
English
Removable and forced subgraphs of graphs
scientific article; zbMATH DE number 7840906

    Statements

    Removable and forced subgraphs of graphs (English)
    0 references
    0 references
    0 references
    30 April 2024
    0 references
    forced subgraph
    0 references
    removable subgraph
    0 references
    nice cycle
    0 references
    perfect matching
    0 references
    \(k\)-extendable graph
    0 references
    Petersen graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references