Maximum cuts in graphs without wheels

DOI10.1017/S0004972718001259MaRDI QIDQ4968449zbMATH OpenWikidataFDO

Authors Jing Lin, Qinghou Zeng, Fuyuan Chen

Publication date 12 July 2019

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

Full work available at URL https://doi.org/10.1017/S0004972718001259

zbMATH Keywords

\(H\)-freemaximum cutwheel graph

Mathematics Subject Classification ID

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

Recommendations

• Maximum cuts of graphs with forbidden cycles
• Maximum bipartite subgraphs in graphs without short cycles
• MaxCut in ${\bm H)$-Free Graphs
• Edge maximal graph without W_k graphs, k=5,6
• Maximum cuts in \(\mathscr{H} \)-free graphs

Cites work

• A note on bipartite subgraphs of triangle‐free graphs
• A note on the Turán function of even cycles
• Asymptotic upper bounds for Ramsey functions
• Bipartite subgraphs
• Bipartite subgraphs of H-free graphs
• Bipartite subgraphs of integer weighted graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Cycles in triangle-free graphs of large chromatic number
• scientific article; zbMATH DE number 3715594 (Why is no real title available?)
• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• scientific article; zbMATH DE number 1787231 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• Judicious partitions and related problems
• MaxCut in ${\bm H)$-Free Graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Maximum cuts of graphs with forbidden cycles
• Maximumk-colorable subgraphs
• On maximal paths and circuits of graphs
• Problems and results on judicious partitions
• The size of the largest bipartite subgraphs

Cited in

(10)

• Maximum cuts in \(\mathscr{H} \)-free graphs
• Edge maximal graphs containing no specific wheels
• Extremal graphs without a semi-topological wheel
• Maximum cuts of graphs with forbidden cycles
• Edge maximal graph without W_k graphs, k=5,6
• Lower bounds for max-cut in H-free graphs via semidefinite programming
• MaxCut in ${\bm H)$-Free Graphs
• Maximum bipartite subgraphs in H-free graphs
• MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS
• Graph partitioning: an updated survey

This page was built for publication: Maximum cuts in graphs without wheels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968449)