Minimum \(k\)-critical bipartite graphs (Q2043356): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Robust Assignments via Ear Decompositions and Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of linear sized tolerant networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Meshes with Small Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process flexibility: design, evaluation, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the size of \((H;1)\)-vertex stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((C_n;k)\) stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (H,k) stable graphs with minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse graphs with dense long paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((K_q,k)\) vertex stable graphs with minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Gaps Between Almost Primes, the Parity Problem, and Some Conjectures of Erdos on Consecutive Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Model for Fault-Tolerant Computing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Vertex Connectivity: New Bounds from Old Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on n-Critical Bipartite Graphs and Its Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in random biregular bipartite graphs / 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: Permanents, Pfaffian orientations, and even directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of network interdiction models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum Fault-Tolerant Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-deletable IM-extendable graphs with minimum number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (Kq;k)-Stable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of an independent set with application to \((K_q; k)\)-stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: General lower bound on the size of \((H; k)\)-stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant meshes with small degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between Extendibility and Factor-Criticality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs / rank
 
Normal rank

Latest revision as of 08:05, 26 July 2024

scientific article
Language Label Description Also known as
English
Minimum \(k\)-critical bipartite graphs
scientific article

    Statements

    Minimum \(k\)-critical bipartite graphs (English)
    0 references
    0 references
    0 references
    2 August 2021
    0 references
    fault-tolerance
    0 references
    interconnection network
    0 references
    bipartite graph
    0 references
    complete matching
    0 references
    algorithm
    0 references
    \(k\)-critical bipartite graph
    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