The following pages link to (Q3898496):
Displaying 50 items.
- The independent transversal dombondage number of a graph (Q327649) (← links)
- Algorithms for interval structures with applications (Q388095) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent (Q726520) (← links)
- Chronological orderings of interval graphs (Q795848) (← links)
- Inverting graphs of rectangular matrices (Q797599) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- Gridline indifference graphs (Q868216) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- The competition number of a graph whose holes do not overlap much (Q987698) (← links)
- Roughness in Cayley graphs (Q991887) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- A characterization of graphs of competition number m (Q1055444) (← links)
- On the domatic number of interval graphs (Q1111388) (← links)
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation (Q1162090) (← links)
- The bondage number of a graph (Q1174124) (← links)
- \((i,j)\) competition graphs (Q1179189) (← links)
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945) (← links)
- Phylogeny numbers (Q1270783) (← links)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
- Block edit models for approximate string matching (Q1391305) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- Phylogeny numbers for graphs with two triangles (Q1570836) (← links)
- A graph with the partial order competition dimension greater than five (Q1741519) (← links)
- Methods for solving road network problems with disruptions (Q1742219) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- The \(k\)-fractal of a simplicial complex (Q1877647) (← links)
- Competition hypergraphs (Q1887068) (← links)
- Niche space, multigraphs, and the Helly condition (Q1900301) (← links)
- The conditional covering problem on unweighted interval graphs with nonuniform coverage radius (Q1948610) (← links)
- On optimal orientations of Cartesian products with a bipartite graph (Q1961236) (← links)
- On upper bound graphs with respect to operations on graphs (Q1978708) (← links)
- A remark on eigen values of signed graph (Q2001838) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
- Spectra of signed graphs (Q2080508) (← links)
- Stationary states and spatial patterning in the cellular automaton \textit{SEIS} epidemiology model (Q2153183) (← links)
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Optimal greedy algorithms for indifference graphs (Q2365550) (← links)
