Greatest common subgraphs of graphs
Work
Year: 1987
Type: article
Abstract: A -graph G without isolated vertices is a greatest common subgraph of a set 0 of graphs, all having the same size, if G is a graph of maximum size that is isomorphic to some sub graph of every graph i... more
Source: Časopis pro pěstování matematiky
Authors Gary Chartrand, Farrokh Saba, Hung Bin Zou
Cites: 1
Cited by: 3
Related to: 10
FWCI: 0.503
Citation percentile (by year/subfield): 49.02
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold