Combinatorics and algorithms for quasi-chain graphs (Q5918620): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3184216788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden induced bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit representations and factorial properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The speed of hereditary properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for graph regularity and removal lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraph isomorphism on proper interval and bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns in permutations and words. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite induced subgraphs and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum induced matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity lemmas for stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycle-free matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum edge biclique problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter graphs and well-quasi-order by induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satgraphs and independent domination. I / rank
 
Normal rank

Latest revision as of 10:30, 28 July 2024

scientific article; zbMATH DE number 7495013
Language Label Description Also known as
English
Combinatorics and algorithms for quasi-chain graphs
scientific article; zbMATH DE number 7495013

    Statements

    Combinatorics and algorithms for quasi-chain graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    bipartite chain graphs
    0 references
    implicit representation
    0 references
    polynomial-time algorithm
    0 references

    Identifiers