scientific article; zbMATH DE number 6004968

zbMATH1249.05363MaRDI QIDQ3115709FDOQ3115709

Authors V. E. Alekseev, D. S. Malyshev

Publication date 10 February 2012

zbMATH Keywords

computational complexityboundary classmaximum subgraph problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Boundary classes for graph problems involving non-local properties
• Boundary classes of graphs for some recognition problems
• Boundary classes of graphs for the dominating set problem
• Boundary Classes of Planar Graphs
• Bounds and extrema for classes of graphs and finite structures
• scientific article; zbMATH DE number 2104812
• Some structural, metric and convex properties of the boundary of a graph
• Boundary graphs: The limit case of a spectral property
• Boundary properties of factorial classes of graphs
• Boundary properties of graphs for algorithmic graph problems

Cited in

(6)

• Boundary Classes of Planar Graphs
• Boundary graph classes for some maximum induced subgraph problems
• Boundary classes for graph problems involving non-local properties
• The boundary of the Gelfand-Tsetlin graph: A new approach
• Vertex coloring of graphs with few obstructions
• Boundary classes of graphs for some recognition problems

This page was built for publication:

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