The following pages link to (Q3328583):
Displayed 50 items.
- A lower bound for the interval number of a graph (Q788751) (← links)
- On the sphericity and cubicity of graphs (Q789416) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks (Q793664) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- On the representation of triangulation graphs in trees (Q794674) (← links)
- Interval line graphs (Q795846) (← links)
- Almost all comparability graphs are UPO (Q795847) (← links)
- Chronological orderings of interval graphs (Q795848) (← links)
- Permutations représentatives d'un graphe à seuil (Q795850) (← links)
- A family of perfect graphs associated with directed graphs (Q796547) (← links)
- Monotonicity of the mean order of subtrees (Q796552) (← links)
- Once more on matrogenic graphs (Q797598) (← links)
- Inverting graphs of rectangular matrices (Q797599) (← links)
- Tolerance graphs (Q798675) (← links)
- Clique graphs of time graphs (Q798677) (← links)
- The structure of rectangle families dividing the plane into maximum number of atoms (Q801060) (← links)
- Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- The treewidth and pathwidth of hypercubes (Q819827) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- The neighborhood polynomial of chordal graphs (Q832856) (← links)
- A new approach for scheduling independent tasks with multiple modes (Q835753) (← links)
- Optimal register allocation for SSA-form programs in polynomial time (Q844183) (← links)
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- An improved algorithm for online coloring of intervals with bandwidth (Q860808) (← links)
- Maximum weight independent set of circular-arc graph and its application (Q861467) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- The interval-merging problem (Q867634) (← links)
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← links)
- Tangent circle graphs and `orders' (Q869563) (← links)