Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Burr, Stefan A.
1982.
Antidirected Subtrees of Directed Graphs.
Canadian Mathematical Bulletin,
Vol. 25,
Issue. 1,
p.
119.
Locke, S. C.
1982.
Maximum k‐colorable subgraphs.
Journal of Graph Theory,
Vol. 6,
Issue. 2,
p.
123.
West, Douglas B.
1985.
Graphs and Order.
p.
267.
Bondy, J. A.
and
Locke, S. C.
1986.
Largest bipartite subgraphs in triangle‐free graphs with maximum degree three.
Journal of Graph Theory,
Vol. 10,
Issue. 4,
p.
477.
Poljak, Svatopluk
and
Turzík, Daniel
1986.
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound.
Discrete Mathematics,
Vol. 58,
Issue. 1,
p.
99.
Hansen, Pierre
and
Jaumard, Brigitte
1990.
Algorithms for the maximum satisfiability problem.
Computing,
Vol. 44,
Issue. 4,
p.
279.
Deza, Michel
Laurent, Monique
and
Poljak, Svatopluk
1992.
The cut cone III: On the role of triangle facets.
Graphs and Combinatorics,
Vol. 8,
Issue. 2,
p.
125.
van Ngoc, Nguyen
and
Tuza, Zsolt
1993.
Linear-Time Approximation Algorithms for the Max Cut Problem.
Combinatorics, Probability and Computing,
Vol. 2,
Issue. 2,
p.
201.
Bollobás, B.
and
Scott, A. D.
1993.
Judicious partitions of graphs.
Periodica Mathematica Hungarica,
Vol. 26,
Issue. 2,
p.
125.
Poljak, Svatopluk
1993.
On existence theorems.
Discrete Mathematics,
Vol. 111,
Issue. 1-3,
p.
423.
Deza, Michel
Laurent, Monique
and
Poljak, Svatopluk
1993.
The cut cone III: On the role of triangle facets.
Graphs and Combinatorics,
Vol. 9,
Issue. 2-4,
p.
135.
Poljak, Svatopluk
and
Tuza, Zsolt
1994.
Bipartite Subgraphs of Triangle-Free Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 7,
Issue. 2,
p.
307.
Merris, Russell
1995.
A survey of graph laplacians.
Linear and Multilinear Algebra,
Vol. 39,
Issue. 1-2,
p.
19.
Alon, Noga
1996.
Bipartite subgraphs.
Combinatorica,
Vol. 16,
Issue. 3,
p.
301.
Hofmeister, Thomas
and
Lefmann, Hanno
1996.
STACS 96.
Vol. 1046,
Issue. ,
p.
439.
Erdős, Paul
Gyárfás, András
and
Kohayakawa, Yoshiharu
1997.
The size of the largest bipartite subgraphs.
Discrete Mathematics,
Vol. 177,
Issue. 1-3,
p.
267.
Bollobás, B.
and
Scott, A.D.
1997.
Judicious Partitions of Hypergraphs.
Journal of Combinatorial Theory, Series A,
Vol. 78,
Issue. 1,
p.
15.
Alon, Noga
and
Halperin, Eran
1998.
Bipartite subgraphs of integer weighted graphs.
Discrete Mathematics,
Vol. 181,
Issue. 1-3,
p.
19.
Bylka, Stanislaw
Idzik, Adam
and
Tuza, Zsolt
1999.
Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality.
Discrete Mathematics,
Vol. 194,
Issue. 1-3,
p.
39.
Mahajan, Meena
and
Raman, Venkatesh
1999.
Parameterizing above Guaranteed Values: MaxSat and MaxCut.
Journal of Algorithms,
Vol. 31,
Issue. 2,
p.
335.