Edge-distance between isomorphism classes of graphs

DOI10.21136/CPM.1987.118317zbMATH Open0646.05035OpenAlexW2628847169MaRDI QIDQ3789595FDOQ3789595

Authors: Bohdan Zelinka 

Publication date: 1987

Full work available at URL: https://eudml.org/doc/21683

Recommendations

• scientific article; zbMATH DE number 89183
• scientific article; zbMATH DE number 125503
• scientific article; zbMATH DE number 431364
• On distances between isomorphism classes of graphs
• Contraction distance between isomorphism classes of graphs

zbMATH Keywords

isomorphism classesedge-distance

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The distance between a graph and its complement
• The isodominism class of the graphs
• Title not available (Why is that?)
• Isomorphic edge disjoint subgraphs of hypergraphs
• Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
• Title not available (Why is that?)

This page was built for publication: Edge-distance between isomorphism classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789595)