Difference graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3743297 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- Extreme degree sequences of simple graphs
- Inequalities: theory of majorization and its applications
- The polytope of degree sequences
- The splittance of a graph
- Threshold Sequences
- Threshold characterization of graphs with dilworth number two
Cited in
(64)- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs
- On difference graphs and the local dimension of posets
- On pairwise compatibility graphs having Dilworth number \(k\)
- Graphs with minimum degree-entropy
- Extremal values of degree-based entropies of bipartite graphs
- Between 2- and 3-colorability
- scientific article; zbMATH DE number 3895098 (Why is no real title available?)
- Many triangles with few edges
- On bipartite graphs having minimum fourth adjacency coefficient
- Minimal classes of graphs of unbounded clique-width
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- A characterization of claw-free \(b\)-perfect graphs
- Decompositions for the edge colouring of reduced indifference graphs.
- On variations of \(P_{4}\)-sparse graphs
- Domination, coloring and stability in \(P_5\)-reducible graphs
- scientific article; zbMATH DE number 5942287 (Why is no real title available?)
- Circular-arc bigraphs and its subclasses
- Strongly perfect claw‐free graphs—A short proof
- New classes of degree sequences with fast mixing swap Markov chain sampling
- scientific article; zbMATH DE number 1424030 (Why is no real title available?)
- Neighborhood degree lists of graphs
- scientific article; zbMATH DE number 1792564 (Why is no real title available?)
- The chain graph sandwich problem
- Graph decompositions in projective geometries
- On 4-Sachs optimal graphs
- Solving matching problems efficiently in bipartite graphs
- Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs
- Properties of random difference graphs
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
- The complexity of the defensive domination problem in special graph classes
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- On double bound graphs and forbidden subposets
- On double bound graphs and forbidden subposets
- Degree sequences and majorization
- Note on upper bound graphs and forbidden subposets
- Bichain graphs: geometric model and universal graphs
- Induced matchings in asteroidal triple-free graphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Majorization and the number of bipartite graphs for given vertex degrees
- Probe threshold and probe trivially perfect graphs
- Combinatorics and algorithms for quasi-chain graphs
- Combinatorics and algorithms for quasi-chain graphs
- Threshold-coloring and unit-cube contact representation of planar graphs
- Equimatchable bipartite graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- Well-graded families of relations
- Vertex types in threshold and chain graphs
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- A characterization of chain probe graphs
- Two characterizations of chain partitioned probe graphs
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- Characterization of graphs with the limited normalized algebraic connectivity
- Enumeration of difference graphs
- Hereditary efficiently dominatable graphs
- The maximum cardinality cut problem in co-bipartite chain graphs
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Precoloring Extension III: Classes of Perfect Graphs
- H-product of graphs, H-threshold graphs and threshold-width of graphs
- On the second largest normalized Laplacian eigenvalue of graphs
- Graph clustering via generalized colorings
- Weak unit disk and interval representation of graphs
- Graphs with the fewest matchings
This page was built for publication: Difference graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895304)
