Neighborhood hypergraphs of bipartite graphs (Q5387058): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20293 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4248711660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-theoretic algorithms and graph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: A V log V algorithm for isomorphism of triconnected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376970 / rank
 
Normal rank

Latest revision as of 09:58, 28 June 2024

scientific article; zbMATH DE number 5275482
Language Label Description Also known as
English
Neighborhood hypergraphs of bipartite graphs
scientific article; zbMATH DE number 5275482

    Statements

    Neighborhood hypergraphs of bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2008
    0 references
    neighborhood hypergraphs
    0 references
    graph isomorphism problem
    0 references
    matrix symmetrization
    0 references
    matrix transposition
    0 references
    symmetrizability
    0 references
    transposability semi-induced matchings in bigraphs
    0 references
    involutory automorphisms
    0 references
    computational complexity
    0 references

    Identifiers