The forcing edge covering number of a graph (Q2892108): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010729687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The forcing geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing matching numbers of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the forced matching numbers of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The forcing Steiner number of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:17, 5 July 2024

scientific article
Language Label Description Also known as
English
The forcing edge covering number of a graph
scientific article

    Statements