The 4-choosability of toroidal graphs without intersecting triangles

Xiaofang Luo

doi:10.1016/j.ipl.2006.11.005

ScienceGate Book Chapters

JOURNAL ARTICLE

The 4-choosability of toroidal graphs without intersecting triangles

Xiaofang Luo

Year: 2006 Journal: Information Processing Letters Vol: 102 (2-3)Pages: 85-91 Publisher: Elsevier BV

DOI: 10.1016/j.ipl.2006.11.005

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Toroid Vertex (graph theory) Planar graph Mathematics Graph Planar Discrete mathematics Computer science Physics Computer graphics (images)

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.16

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

The 4-choosability of toroidal graphs without intersecting triangles

Metrics

Citation History

Topics

Related Documents

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

Choosability with union separation of planar graphs without intersecting triangles

Acyclic 4-choosability of planar graphs without intersecting short cycles

Choosability of toroidal graphs without short cycles

Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles