Polynomial time algorithms for two classes of subgraph problem

DOI10.1051/ro:2008015zbMath1161.05344OpenAlexW1983639627MaRDI QIDQ3598037

Sriraman Sridharan

Publication date: 29 January 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105403

zbMATH Keywords

graphpolynomial time algorithmregular graphNP-completeperfect matchingstar

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Paths, Trees, and Flowers
• The Factorization of Linear Graphs
• Three‐regular subgraphs of four‐regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item