A New Characterization for Parity Graphs and a Coloring Problem With Costs

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0054326
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Optimal Strong Parity Edge-Coloring of Complete Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2008English

The Black-And-White Coloring Problem on Chordal Graphs

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2012English

Plane Graphs With Parity Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A New Characterization of Trivially Perfect Graphs

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2015English

A Hybrid Algorithm for the Robust Graph Coloring Problem

Revista de Matemática: Teoría y Aplicaciones
2016English

Online Coloring of Bipartite Graphs With and Without Advice

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2013English

Total Coloring of Central Graphs of a Path, a Cycle and a Star

International Journal of Scientific and Innovative Mathematical Research
2017English

A Facility Coloring Problem in 1-D

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Coloring Square-Free Berge Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy