scientific article; zbMATH DE number 3859178
From MaRDI portal
Publication:3328583
Recommendations
Cited in
(only showing first 100 items - show all)- A good characterization of squares of strongly chordal split graphs
- Comparability graphs and intersection graphs
- Complexity of conditional colorability of graphs
- A survey on labeling graphs with a condition at distance two
- The complexity of querying indefinite data about linearly ordered domains
- Unit disk graphs
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- On the proper intervalization of colored caterpillar trees
- HAMILTONian circuits in chordal bipartite graphs
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Finding Hamiltonian circuits in proper interval graphs
- The completely positive and doubly nonnegative completion problems
- Complexity of finding graph roots with girth conditions
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- A hybrid tractable class for non-binary CSPs
- On some optimization problems on \(k\)-trees and partial \(k\)-trees
- Heuristics for the network design problem with connectivity requirements
- Broken circuit complexes: Factorizations and generalizations
- Subgraphs and well‐quasi‐ordering
- Tree inference with factors selectively influencing processes in a processing tree
- Two poset polytopes
- Edge and vertex intersection of paths in a tree
- Triangulated edge intersection graphs of paths in a tree
- Augmenting approach for some maximum set problems
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
- The complexity of reconstructing trees from qualitative characters and subtrees
- Graphs of some CAT(0) complexes
- \(T\)-colorings of graphs: recent results and open problems
- Clustering and domination in perfect graphs
- On the tree representation of chordal graphs
- Linear recognition of pseudo-split graphs
- Rankings of graphs
- Intersection graphs of paths in a tree
- Recognition of Robinsonian dissimilarities
- The maximum vertex coverage problem on bipartite graphs
- One-way and round-trip center location problems
- Characterizations of strongly chordal graphs
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- Schur products and matrix completions
- Equistable graphs
- Constructing a stochastic critical path network given the slacks: Representation
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Interval graphs and interval orders
- The coloring problem for classes with two small obstructions
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- Colouring, constraint satisfaction, and complexity
- On intervalizing \(k\)-colored graphs for DNA physical mapping
- Optimal multiple interval assignments in frequency assignment and traffic phasing
- Scheduling jobs with fixed start and end times
- Exact algorithms for intervalizing coloured graphs
- Linear algorithm for optimal path cover problem on interval graphs
- Subgraph isomorphism in graph classes
- Equistable distance-hereditary graphs
- Equistable chordal graphs
- On the \(k\)-coloring of intervals
- Geodeticity of the contour of chordal graphs
- The Complexity of the Partial Order Dimension Problem
- Optimal greedy algorithms for indifference graphs
- Counting and enumerating independent sets with applications to combinatorial optimization problems
- A partial k-arboretum of graphs with bounded treewidth
- Resolutions of Stanley-Reisner rings and Alexander duality
- A characterization of graphs with rank 4
- Quasi‐transitive digraphs
- The maximum clique problem
- The edge intersection graphs of paths in a tree
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
- The Laplacian energy of threshold graphs and majorization
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Self-clique Helly circular-arc graphs
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Bipartite permutation graphs
- Tree spanners on chordal graphs: complexity and algorithms
- I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- Diameter determination on restricted graph families
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Finding a maximum independent set in a permutation graph
- Probability propagation
- Interval digraphs: An analogue of interval graphs
- Efficient algorithms for centers and medians in interval and circular-arc graphs
- Recognizing Helly edge-path-tree graphs and their clique graphs
- Induced matchings
- Modular decomposition and transitive orientation
- On the minimum and maximum selective graph coloring problems in some graph classes
- Bridged graphs and geodesic convexity
- Intersection graphs of halflines and halfplanes
- Interval scheduling: A survey
- Complement reducible graphs
- Nonparametric estimation of the bivariate CDF for arbitrarily censored data
- Simple linear time recognition of unit interval graphs
- The \(k\)-regular induced subgraph problem
- An optimal algorithm to recognize Robinsonian dissimilarities
- On edge perfectness and classes of bipartite graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- The square of a block graph
- Large Induced Subgraphs via Triangulations and CMSO
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 Q3328583)
