The following pages link to (Q3328583):
Displayed 50 items.
- Splitting cubic circle graphs (Q726651) (← links)
- The complexity of list edge-partitions for simple graphs (Q730267) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- On rings whose Beck graph is split (Q747559) (← links)
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- Alternating Whitney sums and matchings in trees. II (Q753825) (← links)
- Stability in CAN-free graphs (Q762505) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- Some results about the interval number of a graph (Q788005) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- 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)