An introduction to convexity in graphs. Paper from the 34th Brazilian mathematics colloquium -- 34\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Structural characterization of families of graphs (05C75) Axiomatic and generalized convexity (52A01) Other problems of combinatorial convexity (52A37) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: An introduction to convexity in graphs. Paper from the 34th Brazilian mathematics colloquium -- 34\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536094)