On the forced matching numbers of bipartite graphs (Q1827691): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2002.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155190380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum number of blocks defining a design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing numbers of stop signs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining sets in vertex colorings of graphs and latin rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing matchings on square grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum forcing number for the torus and hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858978 / rank
 
Normal rank

Latest revision as of 19:25, 6 June 2024

scientific article
Language Label Description Also known as
English
On the forced matching numbers of bipartite graphs
scientific article

    Statements

    On the forced matching numbers of bipartite graphs (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    Forcing number
    0 references
    Matching in graphs
    0 references
    Unique matchings
    0 references
    Hypercubes
    0 references
    0 references