The following pages link to (Q3328583):
Displaying 50 items.
- Improved algorithms for largest cardinality 2-interval pattern problem (Q996829) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- On \(P_4\)-transversals of chordal graphs (Q998435) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Complexity of conditional colorability of graphs (Q1003864) (← links)
- The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803) (← links)
- From a simple elimination ordering to a strong elimination ordering in linear time (Q1007631) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
- Tree inference with factors selectively influencing processes in a processing tree (Q1023422) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Cubicity of threshold graphs (Q1025516) (← links)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
- A characterization of cycle-free unit probe interval graphs (Q1028472) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- Optimal algorithm for a special point-labeling problem (Q1029054) (← links)
- Hardness of edge-modification problems (Q1034612) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- An efficient algorithm to find next-to-shortest path on permutation graphs (Q1034978) (← links)
- A solution method for a car fleet management problem with maintenance constraints (Q1038835) (← links)
- On the cubicity of interval graphs (Q1043802) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- A note on a conjecture by Gavril on clique separable graphs (Q1050357) (← links)
- Some remarks on interval graphs (Q1050372) (← links)
- Characterizations of strongly chordal graphs (Q1051004) (← links)
- Determining the interval number of a triangle-free graph (Q1052345) (← links)
- On powers and centers of chordal graphs (Q1055453) (← links)
- Threshold hypergraphs (Q1057879) (← links)
- Reconnaissance des graphes de cordes (Q1059643) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Interval graphs and interval orders (Q1060230) (← links)
- On the chromatic number of multiple interval graphs and overlap graphs (Q1061131) (← links)
- Covering and coloring problems for relatives of intervals (Q1061132) (← links)
- Triangulated edge intersection graphs of paths in a tree (Q1061147) (← links)
- Split graphs of Dilworth number 2 (Q1063046) (← links)
- Boolean techniques for matroidal decomposition of independence systems and applications to graphs (Q1063611) (← links)
- Finding Hamiltonian circuits in interval graphs (Q1066674) (← links)
