A min-max property of chordal bipartite graphs with applications (Q1959718): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximum induced matchings for chordal graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The induced matching and chain subgraph cover problems for convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in intersection graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum induced matching in weakly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Dimension of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundancy in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval bigraphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Chain Subgraph Cover and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing interval digraphs and interval bigraphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular‐arc digraphs: A characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs for interval digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the k-chain subgraph cover problem / rank
 
Normal rank

Latest revision as of 07:54, 3 July 2024

scientific article
Language Label Description Also known as
English
A min-max property of chordal bipartite graphs with applications
scientific article

    Statements

    A min-max property of chordal bipartite graphs with applications (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    0 references
    chain cover
    0 references
    induced matching
    0 references
    bipartite graphs
    0 references
    0 references