The bipartite edge frustration of composite graphs (Q608263): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61987862, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Largest bipartite subgraphs in triangle-free graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bipartite subgraphs of cubic triangle-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the bipartite edge frustration of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some extremal problems in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal bipartite subgraphs of cubic triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex PI index and Szeged index of bridge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 13:05, 3 July 2024

scientific article
Language Label Description Also known as
English
The bipartite edge frustration of composite graphs
scientific article

    Statements