Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Sparse induced subgraphs in P
6
-free graphs
Maria Chudnovsky
, Rose McCarty
, Marcin Pilipczuk
, Michał Pilipczuk
, Paweł Rzążewski
Mathematics
Research output
:
Contribution to conference
›
Paper
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Sparse induced subgraphs in P
6
-free graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Induced Subgraph
100%
P6-free Graphs
100%
Potential Maximal Cliques
66%
Polynomial Time
33%
Computational Problems
33%
Large Families
33%
Separation Property
33%
Vertex Set
33%
Feedback Vertex Set
33%
Maximum Weight Independent Set Problem
33%
P5-free Graphs
33%
Mathematics
Free Graph
100%
Induced Subgraph
100%
Maximal Clique
50%
Polynomial Time
25%
Independent Set
25%
Computational Problem
25%