Some Algorithms on Conditionally Critical Indecomposable Graphs (Q3439358): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ 4\)-trees and substitution decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218428 / rank
 
Normal rank

Latest revision as of 20:09, 25 June 2024

scientific article
Language Label Description Also known as
English
Some Algorithms on Conditionally Critical Indecomposable Graphs
scientific article

    Statements

    Some Algorithms on Conditionally Critical Indecomposable Graphs (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    0 references
    indecomposable graphs
    0 references
    criticality
    0 references
    3-coloring
    0 references
    perfect matching
    0 references
    0 references