Difference graphs
From MaRDI portal
Publication:5895304
DOI10.1016/0166-218X(90)90092-QzbMath0716.05032OpenAlexW2913398500MaRDI QIDQ5895304
Uri N. Peled, Xiaorong Sun, Peter L. Hammer
Publication date: 1990
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(90)90092-q
Related Items
Graph clustering via generalized colorings, Enumeration of difference graphs, Threshold-coloring and unit-cube contact representation of planar graphs, Well-graded families of relations, Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, Circular‐Arc Bigraphs and Its Subclasses, Hereditary Efficiently Dominatable Graphs, Neighborhood degree lists of graphs, Recognizing simple-triangle graphs by restricted 2-chain subgraph cover, \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs, Solving Matching Problems Efficiently in Bipartite Graphs, Many triangles with few edges, Strongly perfect claw‐free graphs—A short proof, Bichain graphs: geometric model and universal graphs, On 4-Sachs optimal graphs, Decompositions for the edge colouring of reduced indifference graphs., Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs, The maximum cardinality cut problem in co-bipartite chain graphs, On variations of \(P_{4}\)-sparse graphs, Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs, Graph decompositions in projective geometries, Induced matchings in asteroidal triple-free graphs, The chain graph sandwich problem, A characterization of chain probe graphs, Two characterizations of chain partitioned probe graphs, On the complexity of the black-and-white coloring problem on some classes of perfect graphs, Precoloring Extension III: Classes of Perfect Graphs, (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization., A characterization of claw-free \(b\)-perfect graphs, Minimal classes of graphs of unbounded clique-width, New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling, On difference graphs and the local dimension of posets, A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs, On double bound graphs and forbidden subposets, Graphs with the fewest matchings, Between 2- and 3-colorability, On double bound graphs and forbidden subposets, On pairwise compatibility graphs having Dilworth number \(k\), On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs, On the second largest normalized Laplacian eigenvalue of graphs, On the complete width and edge clique cover problems, The complexity of the defensive domination problem in special graph classes, Majorization and the number of bipartite graphs for given vertex degrees, Combinatorics and algorithms for quasi-chain graphs, Combinatorics and algorithms for quasi-chain graphs, On minimal forbidden subgraph characterizations of balanced graphs, Note on upper bound graphs and forbidden subposets, Weak Unit Disk and Interval Representation of Graphs, Weighted coloring on planar, bipartite and split graphs: Complexity and approximation, Probe threshold and probe trivially perfect graphs, Chordal bipartite graphs of bounded tree- and clique-width, Vertex types in threshold and chain graphs, Fast algorithms for computing the characteristic polynomial of threshold and chain graphs, Domination, coloring and stability in \(P_5\)-reducible graphs, Equimatchable bipartite graphs, Degree sequences and majorization, On bipartite graphs having minimum fourth adjacency coefficient, Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
Cites Work
