Sciweavers

    20 search results - page 1 / 4
    » Game List Colouring of Graphs
    Sort
    View
    COMBINATORICS
    2007
    62views more  COMBINATORICS 2007»
    Game List Colouring of Graphs
    13 years 8 months ago
    Game List Colouring of Graphs
    Download  www.combinatorics.org
    Mieczyslaw Borowiecki, Elzbieta Sidorowicz, Zsolt ...
    claim paper
    Read More »
    COMBINATORICS
    2006
    114views more  COMBINATORICS 2006»
    Total 4-Choosability of Series-Parallel Graphs
    13 years 8 months ago
    Total 4-Choosability of Series-Parallel Graphs
    Download  www.univie.ac.at
    It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...
    Douglas R. Woodall
    claim paper
    Read More »
    COMBINATORICS
    2006
    121views more  COMBINATORICS 2006»
    Edge and Total Choosability of Near-Outerplanar Graphs
    13 years 8 months ago
    Edge and Total Choosability of Near-Outerplanar Graphs
    Download  www.univie.ac.at
    It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...
    Timothy J. Hetherington, Douglas R. Woodall
    claim paper
    Read More »
    JCT
    2008
    101views more  JCT 2008»
    Refined activation strategy for the marking game
    13 years 8 months ago
    Refined activation strategy for the marking game
    Download  www.math.nsysu.edu.tw
    This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
    Xuding Zhu
    claim paper
    Read More »
    DM
    2008
    91views more  DM 2008»
    Lower bounds for the game colouring number of partial k-trees and planar graphs
    13 years 8 months ago
    Lower bounds for the game colouring number of partial k-trees and planar graphs
    Download  www.math.nsysu.edu.tw
    This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
    Jiaojiao Wu, Xuding Zhu
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.