The following pages link to Difference graphs (Q5895304):
Displayed 50 items.
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs (Q389453) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- Graphs with the fewest matchings (Q524194) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Two characterizations of chain partitioned probe graphs (Q646714) (← links)
- A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Bichain graphs: geometric model and universal graphs (Q896651) (← links)
- Note on upper bound graphs and forbidden subposets (Q1025563) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- Degree sequences and majorization (Q1322868) (← links)
- Well-graded families of relations (Q1367025) (← links)
- Decompositions for the edge colouring of reduced indifference graphs. (Q1401296) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm (Q1657975) (← links)
- The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Enumeration of difference graphs (Q1894373) (← links)
- On difference graphs and the local dimension of posets (Q1987070) (← links)
- On the second largest normalized Laplacian eigenvalue of graphs (Q2008849) (← links)
- Equimatchable bipartite graphs (Q2107742) (← links)
- On bipartite graphs having minimum fourth adjacency coefficient (Q2117523) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Graph clustering via generalized colorings (Q2136276) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
- Vertex types in threshold and chain graphs (Q2328105) (← links)
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (Q2333249) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- Neighborhood degree lists of graphs (Q2411614) (← links)
- Many triangles with few edges (Q2420564) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling (Q4643313) (← links)
- Precoloring Extension III: Classes of Perfect Graphs (Q4883061) (← links)
- Majorization and the number of bipartite graphs for given vertex degrees (Q5135453) (← links)
- Circular‐Arc Bigraphs and Its Subclasses (Q5325948) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- On double bound graphs and forbidden subposets (Q5899381) (← links)
- Between 2- and 3-colorability (Q5902303) (← links)
- On double bound graphs and forbidden subposets (Q5902336) (← links)