Packing in regular graphs (Q5375889): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3907606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum degree in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence, clique size and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of diameter 2 with cyclic defect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: COVERING AND PACKING IN GRAPHS, I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the independence number of a graph and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Taxonomy of Perfect Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of graphs of diameter 2 and defect 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is No Irregular Moore Graph / rank
 
Normal rank

Latest revision as of 14:34, 16 July 2024

scientific article; zbMATH DE number 6937688
Language Label Description Also known as
English
Packing in regular graphs
scientific article; zbMATH DE number 6937688

    Statements

    Identifiers