Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
DM
2006
favorite
Email
discuss
report
101
views
more
DM 2006
»
Collapsible biclaw-free graphs
13 years 11 months ago
Download
www.math.wvu.edu
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collapsible, and of course supereulerian. This bound is best possible.
Hong-Jian Lai, Xiangjuan Yao
Real-time Traffic
Bipartite Biclaw-free Graph
|
DM 2006
|
claim paper
Related Content
»
Collapsible Pushdown Graphs of Level 2 are TreeAutomatic
»
Equivariant collapses and the homotopy type of iterated clique graphs
»
The Complexity of Model Checking Collapsible HigherOrder Pushdown Systems
»
Graph Isomorphism is in the Low Hierarchy
»
Collapsible Pushdown Automata and Recursion Schemes
»
Complete Strategies for Term Graph Narrowing
»
Satisfiability Allows No Nontrivial Sparsification Unless The PolynomialTime Hierarchy Col...
»
FO Model Checking on Nested Pushdown Trees
»
Latent Dirichlet Bayesian CoClustering
more »
Post Info
More Details (n/a)
Added
11 Dec 2010
Updated
11 Dec 2010
Type
Journal
Year
2006
Where
DM
Authors
Hong-Jian Lai, Xiangjuan Yao
Comments
(0)
Researcher Info
DM 1998 Study Group
Computer Vision