Extremal properties of the bipartite vertex frustration of graphs (Q654182): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ali Reza Ashrafi / rank
Normal rank
 
Property / author
 
Property / author: Ali Reza Ashrafi / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61987699 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.aml.2011.04.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024291253 / 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: On some extremal problems in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extremal Properties of Bipartite Subgraphs / 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: Extremal bipartite subgraphs of cubic triangle-free graphs / rank
 
Normal rank
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: The bipartite edge frustration of composite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bipartite edge frustration of extension of splice and link graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster fixed parameter tractable algorithms for finding feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:38, 4 July 2024

scientific article
Language Label Description Also known as
English
Extremal properties of the bipartite vertex frustration of graphs
scientific article

    Statements

    Identifiers