Boundary classes of graphs for some recognition problems

MaRDI QIDQ3115177zbMATH OpenFDO

Authors D. S. Malyshev

Publication date 20 February 2012

zbMATH Keywords

boundary classcomputational complexityextremal graph problem

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 6004968
• Boundary graph classes for some maximum induced subgraph problems
• NP-hard graph problems and boundary classes of graphs
• Boundary classes of graphs for the dominating set problem
• Boundary Classes of Planar Graphs

Cited in

(14)

• Classes and recognition of curve contact graphs
• The recognition problem for line bigraphs
• Boundary classes for graph problems involving non-local properties
• Boundary graph classes for some maximum induced subgraph problems
• NP-hard graph problems and boundary classes of graphs
• Recognizing cographs and threshold graphs through a classification of their edges
• Continuous sets of the boundary classes of graphs for coloring problems
• On minimal complex classes of graphs
• scientific article; zbMATH DE number 6004968 (Why is no real title available?)
• On the number of boundary classes in the 3-colouring problem
• Boundary Classes of Planar Graphs
• Classification problem for graphs and lattices is wild.
• On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number
• Boundary properties of graphs for algorithmic graph problems

This page was built for publication: Boundary classes of graphs for some recognition problems

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