Structural properties of word representable graphs (Q2630778): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/mics/BeraM16, #quickstatements; #temporary_batch_1731468600454
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11786-016-0257-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2337439960 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62046584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharpening of the Parikh mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: BINARY AMIABLE WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word problem of the Perkins semigroup via directed acyclic graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monoids with sub-log-exponential free spectra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal bipartite graphs with high boxicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph and its complement with specified properties. I: Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval bigraphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of graphs closed under taking powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783331 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mics/BeraM16 / rank
 
Normal rank

Latest revision as of 05:03, 13 November 2024

scientific article
Language Label Description Also known as
English
Structural properties of word representable graphs
scientific article

    Statements

    Structural properties of word representable graphs (English)
    0 references
    0 references
    0 references
    22 July 2016
    0 references
    Parikh matrices
    0 references
    Parikh word representable graph
    0 references
    bipartite chordal graph
    0 references
    graph isomorphism
    0 references
    Hamiltonian cycle
    0 references

    Identifiers