Keywords: نمودارهای کامل; Graph algorithms; Maximum Weight Independent Set problem; Clique separator decomposition; Modular decomposition; Odd-hole-free graphs; Perfect graphs;
مقالات ISI نمودارهای کامل (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: نمودارهای کامل; Graph sandwich problem; Forbidden subgraph; Perfect graphs
Keywords: نمودارهای کامل; Perfect graphs; Berge graphs; Coloring; Maximum stable set; 2-join; Skew partition; Homogeneous pair
Keywords: نمودارهای کامل; Uncapacitated facility location problem; Perfect graphs; Polyhedral combinatorics
Keywords: نمودارهای کامل; Graph classes; Ramsey numbers; Claw-free graphs; Perfect graphs
Keywords: نمودارهای کامل; Graph entropy; Fractional chromatic number; Vertex packing polytope; Perfect graphs
Contraction and deletion blockers for perfect graphs and H-free graphs
Keywords: نمودارهای کامل; Contraction blockers; Deletion blockers; Complexity; Perfect graphs; H-free graphs;
Even pairs and prism corners in square-free Berge graphs
Keywords: نمودارهای کامل; Perfect graphs; Berge graphs; Square-free; Prisms; Even pairs;
The Hadwiger number, chordal graphs and ab-perfection
Keywords: نمودارهای کامل; Complete colorings; Perfect graphs; Forbidden graphs characterization;
Characterizations of (4K1, C4, C5)-free graphs
Keywords: نمودارهای کامل; Graph colouring; (4K1, C4, C5)-free graphs; Perfect graphs;
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
Keywords: نمودارهای کامل; Clique-colouring; Hierarchical complexity; Perfect graphs; Weakly chordal graphs; (alpha beta)-Polar graphs
Obstructions to partitions of chordal graphs
Keywords: نمودارهای کامل; Graph partitions; Graph homomorphisms; Forbidden subgraph characterizations; Chordal graphs; Perfect graphs;
On minimal forbidden subgraph characterizations of balanced graphs
Keywords: نمودارهای کامل; Balanced graphs; Bipartite graphs; Hereditary clique-Helly graphs; Line graphs; Perfect graphs
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Keywords: نمودارهای کامل; Graph algorithms; Maximum Weight Independent Set problem; Graph decomposition; Clique separator decomposition; Modular decomposition; Hole-free graphs; Perfect graphs
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Keywords: نمودارهای کامل; Clique separator decomposition; Hole-free and diamond-free graphs; Hole-free and paraglider-free graphs; Perfect graphs; Efficient algorithms;
On the forbidden induced subgraph sandwich problem
Keywords: نمودارهای کامل; Graph sandwich problems; Forbidden induced subgraphs; Perfect graphs; Even-hole-free graphs; Self-complementary graph classes
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs
Keywords: نمودارهای کامل; Clique-perfect graphs; Coordinated graphs; {gem, W4W4, bull}-free graphs; Paw-free graphs; Perfect graphs; Triangle-free graphs
On cover-structure graphs
Keywords: نمودارهای کامل; Perfect graphs; Berge graphs; Beautiful graphs; Information theory; Communication complexity; Rectangle covers
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
Keywords: نمودارهای کامل; Clique-perfect graphs; Diamond-free graphs; Helly circular-arc graphs; K-perfect graphs; Perfect graphs
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution
Keywords: نمودارهای کامل; Perfect graphs; Partitionable graphs; Decomposition theorems
Skew partitions in perfect graphs
Keywords: نمودارهای کامل; Perfect graphs; Skew partitions; Strong perfect graph conjecture
Constructions for normal graphs and some consequences
Keywords: نمودارهای کامل; Normal graphs; Perfect graphs; Imperfection ratio
Batch processing with interval graph compatibilities between tasks
Keywords: نمودارهای کامل; Batch-scheduling; Task compatibilities; Interval graphs; Perfect graphs; Bounded coloring; Max-coloring
Line-graphs of cubic graphs are normal
Keywords: نمودارهای کامل; Normal graphs; Cubic graphs; Perfect graphs; Line graphs
The 0–1 inverse maximum stable set problem
Keywords: نمودارهای کامل; Inverse combinatorial optimization; Maximum stable set problem; NP-hardness; Approximation ratio; Perfect graphs
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
Keywords: نمودارهای کامل; Claw-free graphs; Clique-perfect graphs; Hereditary clique-Helly graphs; Line graphs; Perfect graphs
A Berge-keeping operation for graphs
Keywords: نمودارهای کامل; 05C17; 05C15; 05C69Coloration; Property-keeping operation (minor); Perfect graphs; Berge-graphs; Odd hole; Odd antihole
Minimal separators in P4P4-sparse graphs
Keywords: نمودارهای کامل; Minimal separation; P4P4-sparse graphs; Cographs; Perfect graphs
Perfect graphs, kernels, and cores of cooperative games
Keywords: نمودارهای کامل; Kernel; Kernel-solvable graphs; Kernel-perfect graph; Perfect graphs; Normal hypergraphs; Cooperative game; Coalition; Stable family of coalitions; Game form; Effectivity function; Stable effectivity functions
Coloring Meyniel graphs in linear time
Keywords: نمودارهای کامل; Perfect graphs; Meyniel graphs; coloring; algorithm;
Characterization and recognition of Helly circular-arc clique-perfect graphs
Keywords: نمودارهای کامل; Clique-perfect graphs; Helly circular-arc graphs; K-perfect graphs; perfect graphs;
Note on the Homogeneous Set Sandwich Problem
Keywords: نمودارهای کامل; Design of algorithms; Sandwich problems; Perfect graphs; Homogeneous sets;
Basic perfect graphs and their extensions
Keywords: نمودارهای کامل; Perfect graphs; Basic graphs; Line graphs; Substitutional closure; Forbidden induced subgraphs;
Efficient parallel recognition of cographs
Keywords: نمودارهای کامل; Perfect graphs; Cographs; Cotree; Connected and co-connected components; Parallel algorithms; Parallel recognition; Certifying algorithms;