A Semi-Strong Perfect Graph Theorem

Journal of Combinatorial Theory. Series B - United States
doi 10.1016/0095-8956(87)90022-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Generalized Graph Strict Strong Coloring Algorithm

International Journal of Applied Metaheuristic Computing
ControlStatisticsProbabilityOptimizationDecision SciencesComputational TheorySimulationComputer Science ApplicationsComputational MathematicsMathematicsModeling
2012English

A Strong Limit Theorem for Gaussian Processes

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1956English

On the Closed Graph Theorem

Glasgow Mathematical Journal
Mathematics
1976English

Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index”

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2003English

Semi-Supervised Deep Hashing With a Bipartite Graph

2017English

Two Short Proofs of the Perfect Forest Theorem

Theory and Applications of Graphs
CombinatoricsNumerical AnalysisTheoretical Computer ScienceDiscrete Mathematics
2017English

A Central Limit Theorem and a Strong Mixing Condition

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1956English

A Semi-Induced Subgraph Characterization of Upper Domination Perfect Graphs

Journal of Graph Theory
GeometryTopology
1999English

Full Perfect Extension Pruning for Frequent Graph Mining

2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy