ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
From MaRDI portal
Publication:5636924
DOI10.1111/j.1749-6632.1970.tb56468.xzbMath0229.05126OpenAlexW2153737011MaRDI QIDQ5636924
Publication date: 1970
Published in: Annals of the New York Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1749-6632.1970.tb56468.x
Related Items
Binary trees and uniform distribution of traffic cutback, Three conjectures of Ostrander on digraph Laplacian eigenvectors, Vertex partitioning problems on graphs with bounded tree width, Erdös distance problems in normed spaces, Algorithms Solving the Matching Cut Problem, Finding matching cuts in \(H\)-free graphs, Asymptotic properties of Fibonacci cubes and Lucas cubes, Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms, Algorithms solving the matching cut problem, \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs, Unnamed Item, Perfectly matched sets in graphs: parameterized and exact computation, Unnamed Item, Distribution of the sum-of-digits function of random integers: a survey, On stable cutsets in claw-free graphs and planar graphs, A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter, Refined notions of parameterized enumeration kernels with applications to matching cut enumeration, Recognizing decomposable graphs, Optimal labelling of a product of two paths, On cubical graphs, Satisfactory graph partition, variants, and generalizations, Unnamed Item, A dynamic location problem for graphs, Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization, Matching cutsets in graphs, The perfect matching cut problem revisited, \((F, I)\)-security in graphs, The perfect matching cut problem revisited, Matching cut in graphs with large minimum degree, Recognizing median graphs in subquadratic time, Extremal graphs having no matching cuts, On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs, The number of edges in a subgraph of a Hamming graph, The bandwidth problem for graphs and matrices—a survey, An FPT algorithm for matching cut and d-cut
