Max-cut and extendability of matchings in distance-regular graphs (Q518196): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2017.01.001 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1432662476 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.06254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Subgraphs and the Smallest Eigenvalue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Remarkable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic Distance-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance-regular graphs of valency four / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex-connectivity of a distance-regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and matching extensions in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Brouwer involving the connectivity of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectedness of the complement of a ball in distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disconnecting strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extendability of matchings in strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-walk-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large incidence-free sets in geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties and the complexity of a max-cut approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The performance of an eigenvalue bound on the max-cut problem in some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral and Geometric Properties of k-Walk-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs without three‐cycles or four‐cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equiarboreal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programs and association schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4033701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs with or at least half the valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-extendability of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Progress in Matching Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max Cut and the Smallest Eigenvalue / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Factors and Matching Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction for bicritical graphs and \(k\)-extendable bipartite graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2017.01.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Max-cut and extendability of matchings in distance-regular graphs
scientific article

    Statements

    Max-cut and extendability of matchings in distance-regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2017
    0 references
    \(t\)-extendable connected graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references