Planar graphs and greatest common subgraphs

DOI10.1007/BF02988313zbMath0786.05027OpenAlexW2087845816MaRDI QIDQ687720

Grzegorz M. Kubicki

Publication date: 28 October 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02988313

zbMATH Keywords

planar graphsgreatest common subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected graphs containing a given connected graph as a unique greatest common subgraph
• Greatest common subgroups with specified properties
• Edge rotations and distance between graphs
• Greatest common subgraphs of graphs
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

This page was built for publication: Planar graphs and greatest common subgraphs