Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
doi 10.1016/s0304-0208(08)72943-8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier

Related search

Perfect Bipolar Fuzzy Graphs

Journal of Mathematics and Computer Science
Computational MechanicsComputational MathematicsComputer Science ApplicationsMathematics
2019English

Polynomial Algorithms for Linear Programming

Lecture Notes in Economics and Mathematical Systems
MathematicsEconomicsEconometricsFinance
1988English

Sieve Algorithms for Perfect Power Testing

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1993English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

NC Algorithms for Computing the Number of Perfect Matchings in K 3,3-Free Graphs and Related Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1988English

Claw-Free Circular-Perfect Graphs

Journal of Graph Theory
GeometryTopology
2010English

Forbidden Structures for Planar Perfect Consecutively Colourable Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

Connected Domination Polynomial of Graphs

Fasciculi Mathematici
2018English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy