{"cited_by_count":928680,"description":"This cluster of papers represents advances in graph theory and algorithms, focusing on topics such as parameterized complexity, fixed-parameter algorithms, constraint satisfaction problems, treewidth, kernelization, complexity classification, approximation algorithms, and homomorphism. The papers cover a wide range of algorithmic applications and theoretical developments in the field of graph theory.","display_name":"Advanced Graph Theory Research","domain_id":"3","external_ids":{"openalex":"https://openalex.org/T10374","wikipedia":"https://en.wikipedia.org/wiki/Graph_theory"},"field_id":"17","id":"T10374","keywords":[{"display_name":"graph coloring","id":"graph-coloring","score":0.3855,"url":"https://openalex.org/keywords/graph-coloring"},{"display_name":"planar graphs","id":"planar-graphs","score":0.4471,"url":"https://openalex.org/keywords/planar-graphs"},{"display_name":"NP-completeness","id":"np-completeness","score":0.2464,"url":"https://openalex.org/keywords/np-completeness"},{"display_name":"fixed-parameter tractability","id":"fixed-parameter-tractability","score":0.7696,"url":"https://openalex.org/keywords/fixed-parameter-tractability"},{"display_name":"graph domination","id":"domination-in-graphs","score":0.8429,"url":"https://openalex.org/keywords/domination-in-graphs"},{"display_name":"parameterized complexity","id":"parameterized-complexity","score":0.7562,"url":"https://openalex.org/keywords/parameterized-complexity"},{"display_name":"chromatic number","id":"chromatic-number","score":0.4909,"url":"https://openalex.org/keywords/chromatic-number"},{"display_name":"graph connectivity","id":"graph-connectivity","score":0.3498,"url":"https://openalex.org/keywords/graph-connectivity"},{"display_name":"treewidth","id":"treewidth","score":0.6998,"url":"https://openalex.org/keywords/treewidth"},{"display_name":"graph classes","id":"graph-classes","score":0.6304,"url":"https://openalex.org/keywords/graph-classes"},{"display_name":"extremal graph theory","id":"extremal-graph-theory","score":0.2265,"url":"https://openalex.org/keywords/extremal-graph-theory"},{"display_name":"domination number","id":"domination-number","score":0.7272,"url":"https://openalex.org/keywords/domination-number"},{"display_name":"graph decomposition","id":"graph-decomposition","score":0.5254,"url":"https://openalex.org/keywords/graph-decomposition"},{"display_name":"graph minors","id":"graph-minors","score":0.7769,"url":"https://openalex.org/keywords/graph-minors"},{"display_name":"complete graphs","id":"complete-graphs","score":0.2433,"url":"https://openalex.org/keywords/complete-graphs"},{"display_name":"linear-time algorithms","id":"linear-time-algorithms","score":0.2085,"url":"https://openalex.org/keywords/linear-time-algorithms"},{"display_name":"chordal graphs","id":"chordal-graphs","score":0.6754,"url":"https://openalex.org/keywords/chordal-graphs"},{"display_name":"graph characterization","id":"graph-characterization","score":0.6353,"url":"https://openalex.org/keywords/graph-characterization"},{"display_name":"dominating sets","id":"dominating-sets","score":0.6619,"url":"https://openalex.org/keywords/dominating-sets"},{"display_name":"Hamiltonian cycles","id":"hamiltonian-cycles","score":0.396,"url":"https://openalex.org/keywords/hamiltonian-cycles"},{"display_name":"maximum degree","id":"maximum-degree","score":0.3201,"url":"https://openalex.org/keywords/maximum-degree"},{"display_name":"independent sets","id":"independent-sets","score":0.3516,"url":"https://openalex.org/keywords/independent-sets"},{"display_name":"graph isomorphism","id":"graph-isomorphism","score":0.2141,"url":"https://openalex.org/keywords/graph-isomorphism"},{"display_name":"induced subgraphs","id":"induced-subgraphs","score":0.4745,"url":"https://openalex.org/keywords/induced-subgraphs"},{"display_name":"cubic graphs","id":"cubic-graphs","score":0.4607,"url":"https://openalex.org/keywords/cubic-graphs"}],"legacy_keywords":["Graph Theory","Parameterized Complexity","Algorithmic Applications","Fixed-Parameter Algorithms","Constraint Satisfaction Problems","Treewidth","Kernelization","Complexity Classification","Approximation Algorithms","Homomorphism"],"openalex_id":"https://openalex.org/T10374","source_created_date":"2024-01-23T15:27:06","source_updated_date":"2026-10-17T03:02:00","subfield_id":"1703","url":"/topics/T10374","works_api_url":"https://api.openalex.org/works?filter=topics.id:T10374","works_count":99253,"label":"Advanced Graph Theory Research","provider":"openalex","revision":"d34997600e437290","taxonomy_revision":"f050b5d4780b1289","title":"Advanced Graph Theory Research","kind":"topic-directory","aeo_cohort":"topic-directory","catalogue_revision":"f050b5d4780b1289","numeric_address":"36174210657291479","address_version":"morton4x16-v1","coordinates":[3,17,1703,10374],"answer_status":"Directory metadata; local answer requires separate source review","truth_status":"Subject descriptor, not a factual answer or a demonstrated knowledge gap","reviewed_answer":null}