Graph Classes: A Survey
From MaRDI portal
Publication:4243764
Recommendations
Cited in
(only showing first 100 items - show all)- On the Colin de Verdière number of graphs
- The k-hop connected dominating set problem: approximation and hardness
- Colinear Coloring on Graphs
- Pathwidth is NP-Hard for Weighted Trees
- Parameterized complexity of vertex deletion into perfect graph classes
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- Split clique graph complexity
- The cluster deletion problem for cographs
- Integral mixed unit interval graphs
- Biclique graphs of interval bigraphs
- Reconfiguration of Steiner trees in an unweighted graph
- Characterization and recognition of generalized clique-Helly graphs
- Farey graphs as models for complex networks
- On the complexity of variations of mixed domination on graphs
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs
- Toll convexity
- Spanning trees in random series-parallel graphs
- Then-ordered graphs: A new graph class
- The one-cop-moves game on graphs with some special structures
- Graph classes with structured neighborhoods and algorithmic applications
- On pairwise compatibility graphs having Dilworth number \(k\)
- Toughness in graphs -- a survey
- Representation characterizations of chordal bipartite graphs
- A generalization of the theorem of Lekkerkerker and Boland
- The minimum vulnerability problem on graphs
- Reconfiguration of vertex covers in a graph
- The axiomatic characterization of the interval function of distance hereditary graphs
- Localized and compact data-structure for comparability graphs
- A New Characterization of P 6-Free Graphs
- Forbidden subgraphs in enhanced power graphs of finite groups
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Hardness and approximation of minimum distortion embeddings
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- Smaller kernels for two vertex deletion problems
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph
- Maximum weight independent sets in hole- and co-chair-free graphs
- A characterization of line graphs that are squares of graphs
- Graph classes and Ramsey numbers
- Finding clubs in graph classes
- A characterization of substar graphs
- Complexity of finding maximum regular induced subgraphs with prescribed degree
- Extremal matching energy and the largest matching root of complete multipartite graphs
- Linear-Interval Dimension and PI Orders
- Block-indifference graphs: characterization, structural and spectral properties
- Routing equal-size messages on a slotted ring
- Characterizing and computing minimal cograph completions
- Eigenvalue-free interval for threshold graphs
- Mim-width. III. Graph powers and generalized distance domination problems
- Random generation and enumeration of bipartite permutation graphs
- Online results for black and white bin packing
- On the iterated biclique operator
- Graphs with sparsity order at most two: the complex case
- Comparability graphs among cover-incomparability graphs
- On the Galois lattice of bipartite distance hereditary graphs
- A polynomial algorithm for some preemptive multiprocessor task scheduling problems
- Bandwidth on AT-free graphs
- How to guard a graph?
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- Decomposing cubic graphs into connected subgraphs of size three
- Clique-width of path powers
- On independent vertex sets in subclasses of apple-free graphs
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
- Block-graph width
- Combinatorial analysis of growth models for series-parallel networks
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- scientific article; zbMATH DE number 2230266 (Why is no real title available?)
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- Dualizing distance-hereditary graphs
- The micro-world of cographs
- Biclique graph of bipartite permutation graphs
- Solving problems on generalized convex graphs via mim-width
- Universal augmentation schemes for network navigability
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
- Efficient parallel recognition of cographs
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- On equistable, split, CIS, and related classes of graphs
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- Generalized distance domination problems and their complexity on graphs of bounded mim-width
- Using contracted solution graphs for solving reconfiguration problems
- Element distinctness revisited
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
- Classes of directed graphs
- Linear structure of bipartite permutation graphs and the longest path problem
- On cycle transversals and their connected variants in the absence of a small linear forest
- Detecting fixed patterns in chordal graphs in polynomial time
- Choosability of P 5-Free Graphs
- scientific article; zbMATH DE number 2230201 (Why is no real title available?)
- Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Pursuing a fast robber on a graph
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- The cyclic rank completion problem with general blocks
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
- A witness version of the cops and robber game
- Difference graphs
- Colouring square-free graphs without long induced paths
This page was built for publication: Graph Classes: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243764)
