ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS

Cited in

(52)

Binary trees and uniform distribution of traffic cutback
Optimal labelling of a product of two paths
On cubical graphs
Recognizing median graphs in subquadratic time
The number of edges in a subgraph of a Hamming graph
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
Erdös distance problems in normed spaces
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
An FPT algorithm for matching cut and d-cut
Vertex partitioning problems on graphs with bounded tree width
Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
Perfectly matched sets in graphs: parameterized and exact computation
Algorithms Solving the Matching Cut Problem
Extremal graphs having no matching cuts
Recognizing decomposable graphs
scientific article; zbMATH DE number 7497799 (Why is no real title available?)
The bandwidth problem for graphs and matrices—a survey
Asymptotic properties of Fibonacci cubes and Lucas cubes
Distribution of the sum-of-digits function of random integers: a survey
scientific article; zbMATH DE number 7378605 (Why is no real title available?)
A generalization of an inequality by Graham
Matching cutsets in graphs
A dynamic location problem for graphs
Three conjectures of Ostrander on digraph Laplacian eigenvectors
The perfect matching cut problem revisited
Matching cut in graphs with large minimum degree
The perfect matching cut problem revisited
Finding matching cuts in \(H\)-free graphs
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
Optimal adjacency labels for subgraphs of Cartesian products
Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
Summing the sum of digits
On graphs embeddable in a layer of a hypercube and their extremal numbers
Finding d-cuts in probe H-free graphs
On polynomial kernelization for stable cutset
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs
Matching cut and variants on bipartite graphs of bounded radius and diameter
Matching cuts in graphs of high girth and H-free graphs
Matching cuts in graphs of high girth and \(H\)-free graphs
Finding \(d\)-cuts in graphs of bounded diameter, graphs of bounded radius and \(H\)-free graphs
On polynomial kernelization for stable cutset
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
Matching (multi)cut: algorithms, complexity, and enumeration
Faster exponential algorithms for cut problems via geometric data structures
(F, I)-security in graphs
Algorithms solving the matching cut problem
On stable cutsets in claw-free graphs and planar graphs
Satisfactory graph partition, variants, and generalizations

This page was built for publication: ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636924)