Complement reducible graphs
From MaRDI portal
Cites work
- 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?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- A Note on "The Comparability Graph of a Tree"
- A V log V algorithm for isomorphism of triconnected planar graphs
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- A note on a paper by D. Seinsche
- Dacey Graphs
- Graph theory
- 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)- On estimation of the number of graphs in some hereditary classes
- Regular languages and partial commutations
- Finding Hamiltonian circuits in quasi-adjoint graphs
- A fast parallel algorithm to recognize P4-sparse graphs
- Enumerating Independent Linear Inferences
- Secure domination in cographs
- Asymptotic enumeration of cographs
- Fully dynamic recognition algorithm and certificate for directed cographs
- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs
- A note on a conjecture for the distance Laplacian matrix
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Characterizing and computing minimal cograph completions
- On the double Roman domination of graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Clique-width of path powers
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Exploring symmetries in cographs: obtaining spectra and energies
- Simple permutations and algebraic generating functions
- On the terminal connection problem
- The micro-world of cographs
- Thinness of product graphs
- On the structure of strong 3-quasi-transitive digraphs
- Efficient parallel recognition of cographs
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Permutation graphs: Connected domination and Steiner trees
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- Some spectral properties of cographs
- Integral cographs
- A time-optimal solution for the path cover problem on cographs.
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Binomial edge ideals of cographs
- Optimal parallel colouring algorithms for totally decomposable graphs
- On the geodeticity of the contour of a graph
- Unsmoothable group actions on compact one-manifolds
- Extending the MAX algorithm for maximum independent set
- Mutual-visibility problems on graphs of diameter two
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
- Generalizing cographs to 2-cographs
- Counting subset repairs with functional dependencies
- \((k,l)\)-colourings and Ferrers diagram representations of cographs
- Weighted connected domination and Steiner trees in distance-hereditary graphs (extended abstract)
- Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
- The monadic second-order logic of graphs. X: Linear orderings
- Cograph editing: Merging modules is equivalent to editing P_4s
- On König graphs with respect to \(P_4\)
- scientific article; zbMATH DE number 7720718 (Why is no real title available?)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- Split non-threshold Laplacian integral graphs
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- Locally perfect graphs
- When can graph hyperbolicity be computed in linear time?
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems
- Minimal asymmetric graphs
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- Subgraph trees in graph theory
- Finding a potential community in networks
- Coupon coloring of cographs
- On the computational difficulty of the terminal connection problem
- Primitivity is hereditary for 2-structures
- The graph sandwich problem for P₄-sparse graphs
- Edge search number of cographs
- The maximum edit distance from hereditary graph properties
- Counting perfect matchings and the switch chain
- Dominating sequences in graphs
- Vertex cover at distance on \(H\)-free graphs
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
- On variations of \(P_{4}\)-sparse graphs
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- Edge-colouring of joins of regular graphs. I
- Edge Search Number of Cographs in Linear Time
- Bi-complement reducible graphs
- Eigenvalue location in cographs
- Stability, vertex stability, and unfrozenness for special graph classes
- Detour trees
- Linearity is strictly more powerful than contiguity for encoding graphs
- On Hadamard diagonalizable graphs
- Completion of Laplacian integral graphs via edge addition
- The harmonious coloring problem is NP-complete for interval and permutation graphs
- The bi-join decomposition
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Algorithms and complexity of sandwich problems in graphs (extended abstract)
- Achromatic number is NP-complete for cographs and interval graphs
- Fixed-parameter algorithms for the cocoloring problem
- Maximization coloring problems on graphs with few \(P_4\)
- Strong triadic closure in cographs and graphs of low maximum degree
- scientific article; zbMATH DE number 2230325 (Why is no real title available?)
- Linearity is strictly more powerful than contiguity for encoding graphs
- Recent developments on graphs of bounded clique-width
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Computing directed Steiner path covers
- Relationships between algebraic connectivity and vertex connectivity
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Clustering and domination in perfect graphs
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs
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)
