The isomorphism problem for classes of graphs closed under contraction (Q1175965): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On testing isomorphism of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism Testing in Hookup Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes / 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: Homomorphiesätze für Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler / rank
 
Normal rank

Latest revision as of 10:24, 15 May 2024

scientific article
Language Label Description Also known as
English
The isomorphism problem for classes of graphs closed under contraction
scientific article

    Statements

    Identifiers