Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs

Daniel Král͏̌; Jan Kratochvı́l; Heinz‐Jürgen Voss

doi:10.1016/s0304-3975(02)00408-5

ScienceGate Book Chapters

JOURNAL ARTICLE

Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs

Daniel Král͏̌Jan Kratochvı́l Heinz‐Jürgen Voss

Year: 2003 Journal: Theoretical Computer Science Vol: 295 (1-3)Pages: 263-278 Publisher: Elsevier BV

DOI: 10.1016/s0304-3975(02)00408-5

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Hypergraph Mathematics Degree (music) Vertex (graph theory) Bounded function Chromatic scale Upper and lower bounds Mixed graph Discrete mathematics Graph

Metrics

Cited By

0.71

FWCI (Field Weighted Citation Impact)

Refs

0.69

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs

Metrics

Citation History

Topics

Related Documents

Edge-Coloring Algorithms for Bounded Degree Multigraphs

Coloring hypergraphs with bounded cardinalities of edge intersections

Coloring block designs as mixed hypergraphs

Mixed hypergraphs and other coloring problems

Edge-coloring of multigraphs