Partitioning kite-free planar graphs into two forests - Details

Author：

Wang, Yang (Wang, Yang.) | Wang, Yiqiao (Wang, Yiqiao.) | Lih, Ko-Wei (Lih, Ko-Wei.)

Indexed by：

EI Scopus

Abstract：

A　kite　is　a　complete　graph　on　four　vertices　with　one　edge　removed.　It　is　proved　that　every　planar　graph　without　a　kite　as　subgraph　can　be　partitioned　into　two　induced　forests.　This　resolves　a　conjecture　of　Raspaud　and　Wang　in　2008.　©　2023　Wiley　Periodicals　LLC.

Keyword：

Graphic methods Graph theory

Author Community：

[ 1 ] [Wang, Yang]Department of Mathematics, Zhejiang Normal University, Jinhua, China
[ 2 ] [Wang, Yiqiao]Department of Mathematics, Beijing University of Technology, Beijing, China
[ 3 ] [Lih, Ko-Wei]Institute of Mathematics, Academia Sinica, Taipei, Taiwan

Reprint Author's Address：

Email：

Show more details

Related Keywords：

Efficient graph-based resource allocation scheme using maximal independent set for randomly-deployed small star networks
2017，Sensors (Switzerland)
A coloring-based resource allocation for OFDMA femtocell networks
2013，2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
Network-wide traffic signal control based on the discovery of critical nodes and deep reinforcement learning
2020，Journal of Intelligent Transportation Systems: Technology, Planning, and Operations
Airspace sectorization based on weighted graph spectral bisection algorithm
2012，12th COTA International Conference of Transportation Professionals: Multimodal Transportation Systems - Convenient, Safe, Cost-Effective, Efficient, CICTP 2012

Source ：

Journal of Graph Theory

ISSN： 0364-9024

Year： 2024

Issue： 1

Volume： 106

Page： 30-56

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 2

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 1

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search Engineering Village

Type
Departments

All Years Choose Year From to