scientific article; zbMATH DE number 3859178
From MaRDI portal
Publication:3328583
Recommendations
Cited in
(only showing first 100 items - show all)- Minimal interval completion through graph exploration
- On the parameterized complexity of multiple-interval graph problems
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Mutual exclusion scheduling with interval graphs or related classes. I
- Complexity of conditional colorability of graphs
- The neighbour-scattering number can be computed in polynomial time for interval graphs
- From a simple elimination ordering to a strong elimination ordering in linear time
- A linear time recognition algorithm for proper interval graphs
- Maximum induced matchings for chordal graphs in linear time
- Tree inference with factors selectively influencing processes in a processing tree
- Resource allocation in bounded degree trees
- Hadwiger's conjecture for proper circular arc graphs
- On a property of minimal triangulations
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Variable sized online interval coloring with bandwidth
- Cubicity of threshold graphs
- An upper bound for cubicity in terms of boxicity
- Localized and compact data-structure for comparability graphs
- The graph sandwich problem for P₄-sparse graphs
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
- A characterization of cycle-free unit probe interval graphs
- A notion of cross-perfect bipartite graphs
- Optimal algorithm for a special point-labeling problem
- Hardness of edge-modification problems
- Distance paired-domination problems on subclasses of chordal graphs
- An efficient algorithm to find next-to-shortest path on permutation graphs
- A solution method for a car fleet management problem with maintenance constraints
- On the cubicity of interval graphs
- Bandwidth of bipartite permutation graphs in polynomial time
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
- Finding Hamiltonian circuits in proper interval graphs
- A note on a conjecture by Gavril on clique separable graphs
- Some remarks on interval graphs
- Characterizations of strongly chordal graphs
- Determining the interval number of a triangle-free graph
- On powers and centers of chordal graphs
- Threshold hypergraphs
- Reconnaissance des graphes de cordes
- Edge and vertex intersection of paths in a tree
- Interval graphs and related topics
- Interval graphs and interval orders
- On the chromatic number of multiple interval graphs and overlap graphs
- Covering and coloring problems for relatives of intervals
- Triangulated edge intersection graphs of paths in a tree
- Split graphs of Dilworth number 2
- Boolean techniques for matroidal decomposition of independence systems and applications to graphs
- Finding Hamiltonian circuits in interval graphs
- Dominating sets and domatic number of circular arc graphs
- Homogeneously representable interval graphs
- Clustering and domination in perfect graphs
- The struction of a graph: Application to CN-free graphs
- \(K_ i\)-covers. I: Complexity and polytopes
- Coloring perfect \((K_ 4\)-e)-free graphs
- Interval graphs and maps of DNA
- Generalized complementation
- Intersection graphs of paths in a tree
- Two poset polytopes
- Circular-arc graphs with clique cover number two
- Relaxations of vertex packing
- A combinatorial bijection between linear extensions of equivalent orders
- Non-interval greedoids and the transposition property
- Interval orders without odd crowns are defect optimal
- How many atoms can be defined by boxes ?
- Cyclic scheduling of offweekends
- Hamiltonian threshold graphs
- Schedule-induced posets
- A note on superbrittle graphs
- On an extremal problem concerning the interval number of a graph
- On randomized stopping points and perfect graphs
- On the computational complexity of the order polynomial
- On the complexity of interval orders and semiorders
- Biorder families, valued relations, and preference modelling
- Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
- Finding the minimum bandwidth of an interval graph
- Hamiltonian circuits in interval graph generalizations
- Bipartite permutation graphs
- On infinite perfect graphs and randomized stopping points on the plane
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Some parallel algorithms on interval graphs
- Scheduling jobs with fixed start and end times
- On the null-homotopy of bridged graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- On domination problems for permutation and other graphs
- Packing and covering a tree by subtrees
- Recognizing max-flow min-cut path matrices
- On embedding graphs in trees
- Generalized neighbourhoods and a class of perfectly orderable graphs
- Computing the link center of a simple polygon
- Unimodularity and circle graphs
- Posets with interval upper bound graphs
- Adamant digraphs
- Multidimensional scaling and threshold graphs
- Bridged graphs and geodesic convexity
- Intersection graphs of halflines and halfplanes
- On the two-phase method for preemptive scheduling
- The maximum k-colorable subgraph problem for chordal graphs
- Dominating sets in social network graphs
- Finding maximum cliques on circular-arc graphs
- Positive semidefinite matrices with a given sparsity pattern
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)
