scientific article; zbMATH DE number 3882470
From MaRDI portal
Publication:3216686
Recommendations
Cited in
(only showing first 100 items - show all)- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- On the parameterized complexity of coloring graphs in the absence of a linear forest
- Polynomial and APX-hard cases of the individual haplotyping problem
- Complexity results on cosecure domination in graphs
- Algorithms and almost tight results for 3-colorability of small diameter graphs
- Testing consumer rationality using perfect graphs and oriented discs
- Transitive orientations in bull-reducible Berge graphs
- Recognizing Graphs Close to Bipartite Graphs
- scientific article; zbMATH DE number 2196279 (Why is no real title available?)
- Faster 3-coloring of small-diameter graphs
- Even pairs in claw-free perfect graphs
- Mode packing and perfect graphs
- Colouring vertices of triangle-free graphs without forests
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- The maximum clique problem
- Lifting for simplicity: concise descriptions of convex sets
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- Colouring square-free graphs without long induced paths
- Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem
- Colouring Some Classes of Perfect Graphs Robustly
- Polyhedral sets and integer rounding
- Perfect circular arc coloring
- On dart-free perfectly contractile graphs
- Graphs without large apples and the maximum weight independent set problem
- scientific article; zbMATH DE number 2196278 (Why is no real title available?)
- The weighted coloring problem for two graph classes characterized by small forbidden induced structures
- Path parity and perfection
- Coloring perfect degenerate graphs
- Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes
- A note on line digraphs and the directed max-cut problem
- Maximum regular induced subgraphs in 2P₃-free graphs
- Independent packings in structured graphs
- Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations
- NeST graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- An SDP primal-dual algorithm for approximating the Lovász-theta function
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- Colouring H-free graphs of bounded diameter.
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs
- Proper interval vertex deletion
- Clustering and domination in perfect graphs
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
- On the use of Boolean methods for the computation of the stability number
- Orthogonal representations and connectivity of graphs
- The complexity of dissociation set problems in graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- Convexity in partial cubes: the hull number
- scientific article; zbMATH DE number 3888924 (Why is no real title available?)
- Completely separable graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Independent feedback vertex sets for graphs of bounded diameter
- Novel evolutionary models and applications to sequence alignment problems
- Partially concurrent open shop scheduling with integral preemptions
- Generalized perfect graphs: Characterizations and inversion
- Sequential colorings and perfect graphs
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function
- A coloring algorithm for \(4 K_1\)-free line graphs
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
- Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
- On list \(k\)-coloring convex bipartite graphs
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Getting linear time in graphs of bounded neighborhood diversity
- Exactly hittable interval graphs
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
- Polynomially solvable cases for the maximum stable set problem
- Optimizing weakly triangulated graphs
- New results on independent sets in extensions of \(2K_2\)-free graphs
- On coloring a class of claw-free graphs.
- Stability in \(P_5\)- and banner-free graphs
- \(F\)-WORM colorings: results for 2-connected graphs
- Colouring \((P_r + P_s)\)-free graphs
- Weighted sum coloring in batch scheduling of conflicting jobs
- Complexity and polynomially solvable special cases of QUBO
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Recognition of unipolar and generalised split graphs
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets
- The MaxIS-Shapley value in perfect graphs
- List coloring in the absence of a linear forest
- On Tucker vertices of graphs
- The intersection of two vertex coloring problems
- Colouring square-free graphs without long induced paths
- On the optimal transversals of the odd cycles
- An algorithm for coloring some perfect graphs
- Comparability graph augmentation for some multiprocessor scheduling problems
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
- Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with 5-vertex prohibitions
- Relaxations of vertex packing
- List coloring in the absence of a linear forest
- Quadratic bottleneck knapsack problems
- One-three join: a graph operation and its consequences
- Colouring diamond-free graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- On extended P₄-reducible and extended P₄-sparse graphs
- The theta body and imperfection
- Clique and chromatic number of circular-perfect graphs
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Solving some NP-complete problems using split decomposition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216686)
