Pages that link to "Item:Q2396159"
From MaRDI portal
The following pages link to On some extremal problems in graph theory (Q2396159):
Displayed 50 items.
- The bipartite edge frustration of hierarchical product of graphs (Q277458) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- The bipartite edge frustration of composite graphs (Q608263) (← links)
- On bipartite restrictions of binary matroids (Q648977) (← links)
- The bipartite edge frustration of graphs under subdivided edges and their related sums (Q651481) (← links)
- Extremal properties of the bipartite vertex frustration of graphs (Q654182) (← links)
- Coloring a graph optimally with two colors (Q685594) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- How to make a graph bipartite (Q805628) (← links)
- The anti-Kekulé number of graphs (Q830774) (← links)
- The bipartite edge frustration of extension of splice and link graphs (Q988725) (← links)
- Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782) (← links)
- On a Turán type problem of Erdős (Q1180412) (← links)
- On complete subgraphs of \(r\)-chromatic graphs (Q1217812) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- The line index and minimum cut of weighted graphs (Q1303736) (← links)
- On cycle lengths in graphs of moderate degree (Q1322247) (← links)
- The size of the largest bipartite subgraphs (Q1377883) (← links)
- Graph-theoretical methods in general function theory (Q1565884) (← links)
- Upper bounds for \(f\)-domination number of graphs (Q1584247) (← links)
- On the Turán density of \(\{1, 3\}\)-hypergraphs (Q1732027) (← links)
- Covers in hypergraphs (Q1838499) (← links)
- Cycles of even length in graphs (Q1844243) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- The multicolor size-Ramsey numbers of cycles (Q2101174) (← links)
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor (Q2151177) (← links)
- Nearly-linear monotone paths in edge-ordered graphs (Q2200054) (← links)
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} (Q2300620) (← links)
- Eigenvector-based identification of bipartite subgraphs (Q2328104) (← links)
- extremal aspects of the Erdős-Gallai-Tuza conjecture (Q2342626) (← links)
- A note on bipartite subgraphs and triangle-independent sets (Q2374154) (← links)
- On sufficient conditions for rainbow cycles in edge-colored graphs (Q2421861) (← links)
- On the anti-Kekulé number and odd cycle transversal of regular graphs (Q2446864) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- On the chromatic number of Steiner triple systems of order 25 (Q2568479) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties (Q2686111) (← links)
- On a Conjecture of Erdős, Gallai, and Tuza (Q2947853) (← links)
- Study of the Bipartite Edge Frustration of Graphs (Q2980024) (← links)
- Multiple Domination (Q3384609) (← links)
- Ramsey Size Linear Graphs (Q4290091) (← links)
- On $f$-domination number of a graph (Q4368817) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- Large triangle packings and Tuza’s conjecture in sparse random graphs (Q4987259) (← links)
- (Q5090437) (← links)
- (Q5091019) (← links)
- Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process (Q5157383) (← links)
- Maximum cuts in edge-colored graphs (Q5918845) (← links)
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties (Q6057659) (← links)