The following pages link to Complement reducible graphs (Q1153105):
Displaying 50 items.
- Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
- Graphs whose complement and square are isomorphic (Q2449164) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- Edge-colouring of regular graphs of large degree (Q2465629) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- Self-spanner graphs (Q2565853) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Complete characterization of incorrect orthology assignments in best match graphs (Q2659043) (← links)
- Graph classes with linear Ramsey numbers (Q2659214) (← links)
- Perfect graphs for domination games (Q2660136) (← links)
- Perfect Italian domination in cographs (Q2661056) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Families of integral cographs within a triangular array (Q2663694) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs (Q2689127) (← links)
- Asymptotic enumeration of cographs (Q2741466) (← links)
- A note on a conjecture for the distance Laplacian matrix (Q2794396) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
- Symmetric linear spaces of graphs (Q2889726) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- Strongly Even-Cycle Decomposable Graphs (Q2958205) (← links)
- (Q2964106) (← links)
- 4‐Coloring <i>P</i> <sub>6</sub> ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- A note on the bichromatic numbers of graphs (Q3061187) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- (Q3121527) (← links)
- On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240) (← links)
- When every k-cycle has at least f(k) chords (Q3174243) (← links)
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (Q3196420) (← links)
- On estimation of the number of graphs in some hereditary classes (Q3225907) (← links)
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) (Q3297784) (← links)
- On Some Properties of the Struction of a Graph (Q3328582) (← links)
- Defining and identifying cograph communities in complex networks (Q3387608) (← links)
- The bi-join decomposition (Q3439330) (← links)
- Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
- Independent Domination in Triangle Graphs (Q3439603) (← links)
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- A Brooks‐Type Theorem for the Bichromatic Number (Q3466343) (← links)
- <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs (Q3476849) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
