Graphs With Bounded Tree-Width and Large Odd-Girth Are Almost Bipartite

Journal of Combinatorial Theory. Series B - United States
doi 10.1016/j.jctb.2010.04.004
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Collective Tree Spanners in Graphs With Bounded Genus, Chordality, Tree-Width, or Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Parametric Problems on Graphs of Bounded Tree-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

Planar Graphs of Odd-Girth at Least 9 Are Homomorphic to the Petersen Graph

SIAM Journal on Discrete Mathematics
Mathematics
2008English

Acyclic Colourings of Planar Graphs With Large Girth

Journal of the London Mathematical Society
Mathematics
1999English

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

List Edge Chromatic Number of Graphs With Large Girth

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1992English

The Stable Set Problem in Graphs With Bounded Genus and Bounded Odd Cycle Packing Number

2020English

Topological Minors in Graphs of Large Girth

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2002English

Parity Games of Bounded Tree- And Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy