Complement reducible graphs
From MaRDI portal
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- A Note on "The Comparability Graph of a Tree"
- A note on a paper by D. Seinsche
- A V log V algorithm for isomorphism of triconnected planar graphs
- Dacey Graphs
- Graph theory
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3779321 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3575612 (Why is no real title available?)
- Isomorphism Testing in Hookup Classes
- On a class of posets and the corresponding comparability graphs
- On a property of the class of n-colorable graphs
- On cliques in graphs
- The Comparability Graph of a Tree
Cited in
(only showing first 100 items - show all)- Representation of graphs by OBDDs
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- On the OBDD size for graphs of bounded tree- and clique-width
- The graph sandwich problem for P₄-sparse graphs
- Algorithmic aspects of a general modular decomposition theory
- Some optimization problems on weak-bisplit graphs
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- A note on a conjecture by Gavril on clique separable graphs
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Clustering and domination in perfect graphs
- Distance-hereditary graphs
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Locally perfect graphs
- Dominating sets in social network graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Strong tree-cographs are Birkhoff graphs
- Permutation graphs: Connected domination and Steiner trees
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- A tree representation for \(P_ 4\)-sparse graphs
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- Automorphism groups of graphs with forbidden subgraphs
- \(P_ 4\)-trees and substitution decomposition
- On estimating the number of order ideals in partial orders, with some applications
- An optimal parallel algorithm for node ranking of cographs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Triangulating graphs with few \(P_4\)'s
- Partial and perfect path covers of cographs
- Hamiltonian powers in threshold and arborescent comparability graphs
- Modular decomposition and transitive orientation
- A linear time algorithm for the maximum matching problem on cographs
- On cocolourings and cochromatic numbers of graphs
- On \(m\)-centers in \(P_ t\)-free graphs
- A theorem on permutation graphs with applications
- PLA folding in special graph classes
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Complexity of list coloring problems with a fixed total number of colors
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Bi-complement reducible graphs
- Matroids arisen from matrogenic graphs
- On semi-\(P_ 4\)-sparse graphs
- Scattering number and modular decomposition
- Generalized coloring for tree-like graphs
- The monadic second-order logic of graphs. X: Linear orderings
- A fast parallel algorithm to recognize P4-sparse graphs
- Logical description of context-free graph languages
- On the structure of graphs with few P₄s
- A time-optimal solution for the path cover problem on cographs.
- On variations of \(P_{4}\)-sparse graphs
- Subgraph trees in graph theory
- Stability number of bull- and chair-free graphs revisited
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Permutations, parenthesis words, and Schröder numbers
- Tree-like P₄-connected graphs
- Eigenvalue location in graphs of small clique-width
- Multiplicity of eigenvalues of cographs
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
- Approximating weighted neighborhood independent sets
- Locally identifying coloring of graphs with few P4s
- Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs
- Cograph generation with linear delay
- Solving problems on graphs of high rank-width
- Induced saturation of graphs
- The secure domination problem in cographs
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Finding a potential community in networks
- Coupon coloring of cographs
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Eigenvalue location in cographs
- The chromatic symmetric functions of trivially perfect graphs and cographs
- Monotonicity and expansion of global secure sets
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Linear-time modular decomposition of directed graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Systems of distant representatives
- Path partition for graphs with special blocks
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- Parameterized algorithms for conflict-free colorings of graphs
- Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
- Hamiltonicity in graphs with few \(P_ 4\)'s
- Achromatic number is NP-complete for cographs and interval graphs
- Unavoidable doubly connected large graphs
- Towards the reconstruction of posets
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Isomorphism of chordal (6, 3) graphs
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- An optimal path cover algorithm for cographs
- Homomorphically full graphs
- HAMILTONian circuits in chordal bipartite graphs
- Quasi-threshold graphs
- Orthology relations, symbolic ultrametrics, and cographs
- Embeddability between right-angled Artin groups..
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs
- Oriented coloring on recursively defined digraphs
- Limits of structures and the example of tree semi-lattices
This page was built for publication: Complement reducible graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153105)
