On 2-factors with cycles containing specified edges in a bipartite graph (Q1011783): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for 2-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors containing 1-factors in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles containing specified edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuits in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partition problems into cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture on cycles in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint triangles and quadrilaterals in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors with prescribed properties in a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint quadrilaterals in bipartite graphs / rank
 
Normal rank

Latest revision as of 11:01, 1 July 2024

scientific article
Language Label Description Also known as
English
On 2-factors with cycles containing specified edges in a bipartite graph
scientific article

    Statements

    Identifiers