scientific article; zbMATH DE number 3882470
From MaRDI portal
Publication:3216686
Recommendations
Cited in
(only showing first 100 items - show all)- Coloring Artemis graphs
- Weighted sum coloring in batch scheduling of conflicting jobs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Testing membership in matroid polyhedra
- Clustering and domination in perfect graphs
- Relaxations of vertex packing
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Even pairs in claw-free perfect graphs
- A note on line digraphs and the directed max-cut problem
- Stability number of bull- and chair-free graphs
- An algorithm for finding a maximum clique in a graph
- The complexity of some problems related to GRAPH 3-COLORABILITY
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
- Sequential colorings and perfect graphs
- On Tucker vertices of graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- The maximum clique problem
- Well-covered graphs and extendability
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Geometric comparison of combinatorial polytopes
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Coloring perfect degenerate graphs
- Restricted coloring models for timetabling
- Path parity and perfection
- On semi-\(P_ 4\)-sparse graphs
- On the optimal transversals of the odd cycles
- A nice class for the vertex packing problem
- On the use of Boolean methods for the computation of the stability number
- Optimal channel allocation for several types of cellular radio networks
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- An algorithm for coloring some perfect graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- On extended P₄-reducible and extended P₄-sparse graphs
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
- Stability in \(P_5\)- and banner-free graphs
- NeST graphs
- The weighted coloring problem for two graph classes characterized by small forbidden induced structures
- Independent feedback vertex sets for graphs of bounded diameter
- A coloring algorithm for \(4 K_1\)-free line graphs
- Some problems on induced subgraphs
- Partially concurrent open shop scheduling with integral preemptions
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs
- Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem
- Recognition of unipolar and generalised split graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Polynomial and APX-hard cases of the individual haplotyping problem
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- On a connection between facility location and perfect graphs
- Optimizing weakly triangulated graphs
- Orthogonal representations and connectivity of graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- On dart-free perfectly contractile graphs
- Polynomially solvable cases for the maximum stable set problem
- Generalized perfect graphs: Characterizations and inversion
- Some geometric results in semidefinite programming
- On edge perfectness and classes of bipartite graphs
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- Proper interval vertex deletion
- Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- On list \(k\)-coloring convex bipartite graphs
- On coloring a class of claw-free and hole-twin-free graphs
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs
- On coloring a class of claw-free graphs.
- On the structure of graphs without claw, \(4K_1\) and co-R
- New results on independent sets in extensions of \(2K_2\)-free graphs
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
- Colouring \((P_r + P_s)\)-free graphs
- The clique problem with multiple-choice constraints under a cycle-free dependency graph
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Perfect graphs and guarding rectilinear art galleries
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- An SDP primal-dual algorithm for approximating the Lovász-theta function
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- List coloring in the absence of a linear forest
- On the complexity of the independent set problem in triangle graphs
- The complexity of dissociation set problems in graphs
- The intersection of two vertex coloring problems
- Colouring square-free graphs without long induced paths
- Quadratic bottleneck knapsack problems
- One-three join: a graph operation and its consequences
- The story of perfectly orderable graphs
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
- A linear kernel for finding square roots of almost planar graphs
- Colouring diamond-free graphs
- \(F\)-WORM colorings: results for 2-connected graphs
- A scheme for computing minimum covers within simple regions
- Independent set of intersection graphs of convex objects in 2D
- Minimum cost and list homomorphisms to semicomplete digraphs
- On extracting maximum stable sets in perfect graphs using Lovász's theta function
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- Perfect circular arc coloring
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Independent packings in structured graphs
- Algorithms and almost tight results for 3-colorability of small diameter graphs
- Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
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)
