Pages that link to "Item:Q5636924"

The following pages link to ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS (Q5636924):

Displaying 39 items.

• Asymptotic properties of Fibonacci cubes and Lucas cubes (Q404538) (← links)
• Distribution of the sum-of-digits function of random integers: a survey (Q462807) (← links)
• A dynamic location problem for graphs (Q583245) (← links)
• \((F, I)\)-security in graphs (Q741750) (← links)
• Algorithms solving the matching cut problem (Q897900) (← links)
• On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
• Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
• Binary trees and uniform distribution of traffic cutback (Q1076523) (← links)
• Optimal labelling of a product of two paths (Q1214948) (← links)
• On cubical graphs (Q1215634) (← links)
• Recognizing median graphs in subquadratic time (Q1285576) (← links)
• The number of edges in a subgraph of a Hamming graph (Q1600356) (← links)
• A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
• Erdös distance problems in normed spaces (Q1917053) (← links)
• Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
• On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
• An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
• Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
• Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
• Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
• Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
• Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
• Extremal graphs having no matching cuts (Q3113291) (← links)
• Recognizing decomposable graphs (Q3320412) (← links)
• (Q3390419) (← links)
• The bandwidth problem for graphs and matrices—a survey (Q3956994) (← links)
• (Q5009482) (← links)
• (Q5088697) (← links)
• Matching cutsets in graphs (Q5203060) (← links)
• Three conjectures of Ostrander on digraph Laplacian eigenvectors (Q5888904) (← links)
• The perfect matching cut problem revisited (Q5918785) (← links)
• Matching cut in graphs with large minimum degree (Q5925521) (← links)
• The perfect matching cut problem revisited (Q5925551) (← links)
• Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
• \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
• Optimal adjacency labels for subgraphs of Cartesian products (Q6581611) (← links)
• Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)
• Summing the sum of digits (Q6615625) (← links)
• On graphs embeddable in a layer of a hypercube and their extremal numbers (Q6644279) (← links)