Online Coloring of Bipartite Graphs With and Without Advice

Algorithmica - United States
doi 10.1007/s00453-013-9819-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Online Matching in Regular Bipartite Graphs With Randomized Adversary

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Approximating Chromatic Sum Coloring of Bipartite Graphs in Expected Polynomial Time

Proceedings of the Institute for System Programming of RAS
2015English

P_m-Saturated Bipartite Graphs With Minimum Size

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

Domination in Bipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

Infinite Homogeneous Bipartite Graphs With Unequal Sides

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1996English

Strong T-Coloring of Graphs

International Journal of Innovative Technology and Exploring Engineering
Mechanics of MaterialsElectronic EngineeringCivilStructural EngineeringElectricalComputer Science
2019English

Equitable Coloring of Random Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy