MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS

DOI10.1017/S0004972718001259zbMath1416.05153WikidataQ128695261 ScholiaQ128695261MaRDI QIDQ4968449

Qinghou Zeng, Jing Lin, Fu-Yuan Chen

Publication date: 12 July 2019

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

maximum cutwheel graph\(H\)-free

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Graph partitioning: an updated survey ⋮ Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming

Cites Work

• The size of the largest bipartite subgraphs
• Bipartite subgraphs of integer weighted graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Cycles in triangle-free graphs of large chromatic number
• Bipartite subgraphs
• A note on the Turán function of even cycles
• On maximal paths and circuits of graphs
• Maximumk-colorable subgraphs
• A note on bipartite subgraphs of triangle‐free graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Maximum cuts of graphs with forbidden cycles
• Problems and results on judicious partitions
• BIPARTITE SUBGRAPHS OF -FREE GRAPHS
• MaxCut in ${\bm H)$-Free Graphs
• Asymptotic upper bounds for Ramsey functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS