The Menger number of the Cartesian product of graphs (Q628251): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of reliable networks - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs as models of communication network vulnerability: Connectivity and persistence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to a conjecture on paths of bounded length / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding maximum disjoint paths with length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded edge-connectivity and edge-persistence of Cartesian product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for finding a maximum number of disjoint bounded paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and pancyclicity of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(\{k\}\)-domination number of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retracts of strong products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Cartesian product graphs / rank
 
Normal rank

Latest revision as of 20:19, 3 July 2024

scientific article
Language Label Description Also known as
English
The Menger number of the Cartesian product of graphs
scientific article

    Statements

    Identifiers