Search Results - "ACM Classification: G.2.1 Combinatorics G.2.2 Graph Theory General Terms: Algorithms"

Forbidden subgraphs in connected graphs

Authors: Ravelomanana, Vlady Loÿs, Thimonier Laboratoire d'Informatique de Paris-Nord (LIPN) et al.

Contributors: Ravelomanana, Vlady Loÿs, Thimonier Laboratoire d'Informatique de Paris-Nord (LIPN) et al.

Source: Theoretical Computer Science. 314:121-171

Subject Terms: FOS: Computer and information sciences, Labelled graphs, triangle-free graphs, Discrete Mathematics (cs.DM), multivariate generating functions, Exact enumeration problems, generating functions, Random graphs (graph-theoretic aspects), 0102 computer and information sciences, enumerative combinatorics, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Enumeration in graph theory, 01 natural sciences, Combinatorial problems, forbidden subgraphs, Theoretical Computer Science, labelled graphs, asymptotic enumeration, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Computer Science - Data Structures and Algorithms, analytic combinatorics, FOS: Mathematics, Mathematics - Combinatorics, Theory, Data Structures and Algorithms (cs.DS), 0101 mathematics, Enumerative combinatorics, Triangle-free graphs, random graphs, Random graphs, Asymptotic enumeration, ACM Classification: G.2.1 Combinatorics G.2.2 Graph Theory General Terms: Algorithms, Combinatorics (math.CO), ACM Classification: G.2.1 Combinatorics G.2.2 Graph Theory General Terms: Algorithms, Theory, Multivariate generating functions, Analytic combinatorics, Computer Science(all), Computer Science - Discrete Mathematics

File Description: application/xml

Access URL: http://arxiv.org/abs/cs/0411093