Uncertain vertex coloring problem

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Soft Computing - A Fusion of Foundations, Methodologies and Applications

• Publication date

  2017-10-20

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00500-017-2861-7
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fuzzy Graphs

  2019cited by this paper
• Every Planar Map Is Four Colorable

  2019cited by this paper
• An uncertain chromatic number of an uncertain graph based on $$\alpha $$α-cut coloring

  2018cited by this paper
• An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem

  2017cited by this paper
• Fuzzy ϕ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}-tolerance competition graphs

  2016cited by this paper
• On the Minimum and Maximum Selective Graph Coloring Problems

  2016cited by this paper
• An α-cut chromatic number of a total uncertain graph and its properties

  2016cited by this paper
• An uncertain chromatic number of an uncertain graph based on α -cut coloring

  2016cited by this paper
• On Computing the Edge-Connectivity of an Uncertain Graph

  2016cited by this paper
• A theoretical extension on the operational law for monotone functions of uncertain variables

  2016cited by this paper
• Tree index of uncertain graphs

  2015cited by this paper
• Fuzzy colouring of fuzzy graphs

  2015cited by this paper
• On distribution function of the diameter in uncertain graph

  2015cited by this paper
• A new approach for determining fuzzy chromatic number of fuzzy graph

  2015cited by this paper
• Vertex-coloring of fuzzy graphs: A new approach

  2015cited by this paper
• Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams

  2014cited by this paper
• Uncertain Random Graph and Uncertain Random Network Baoding

  2014cited by this paper
• Connectedness Index of uncertain Graph

  2013influential reference
• A memetic algorithm for the Minimum Sum Coloring Problem

  2013cited by this paper
• Average-case complexity of backtrack search for coloring sparse random graphs

  2013cited by this paper
• Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges

  2012cited by this paper
• Why is There a Need for Uncertainty Theory

  2012cited by this paper
• Euler index in uncertain graph

  2012cited by this paper
• A survey on vertex coloring problems

  2010cited by this paper
• A memetic algorithm for graph coloring

  2010influential reference
• Some Research Problems in Uncertainty Theory

  2009cited by this paper
• Coloring fuzzy circular interval graphs

  2009cited by this paper
• A note on coloring sparse random graphs

  2009cited by this paper
• The labeled maximum matching problem

  2009cited by this paper
• A Metaheuristic Approach for the Vertex Coloring Problem

  2008cited by this paper
• A coloring fuzzy graph approach for image classification

  2006cited by this paper
• Random graphs

  2006cited by this paper
• Detecting change in vague interpretations of landscapes

  2006cited by this paper
• Coloring fuzzy graphs

  2005cited by this paper
• Uncertainty Theory

  2004cited by this paper
• The Four-Colour Theorem

  1997cited by this paper
• Tolerance competition graphs

  1995cited by this paper
• The priority-based coloring approach to register allocation

  1990cited by this paper
• The chromatic number of random graphs

  1988cited by this paper
• Random Graphs

  1985cited by this paper
• A random graph

  1981cited by this paper
• Fuzzy sets and their applications to cognitive and decision processes

  1977cited by this paper
• FUZZY GRAPHS††The support of the Office of Computing Activities, National Science Foundation, under Grant GJ-32258X, is gratefully acknowledged, as is the help of Shelly Rowe in preparing this paper.

  1975cited by this paper
• Algorithm 97: Shortest path

  1962cited by this paper

• Efficient Hybridization of Quantum Annealing and Ant Colony Optimization for Coloring DIMACS Graph Instances

  2025cites this paper
• Dominated coloring in certain trees

  2025cites this paper
• Dominated coloring in certain networks

  2024cites this paper
• A systematic review of uncertainty theory with the use of scientometrical method

  2022cites this paper
• Parameter-free and cooperative local search algorithms for graph colouring

  2021cites this paper
• Vertex Coloring of a Graph for Memory Constrained Scenarios

  2019cites this paper
• First hitting time of uncertain random renewal reward process and its application in insurance risk process

  2019cites this paper
• Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs

  2019cites this paper
• Radio fuzzy graphs and assignment of frequency in radio stations

  2019cites this paper
• Facebook Dynamics: Modelling and Statistical Testing

  2018cites this paper
• Entropy-based multi-item solid transportation problems with uncertain variables

  2018influential citation
• Cycle index of uncertain random graph

  2018cites this paper
• First hitting time of uncertain random renewal reward process and its application in insurance risk process

  2018influential citation
• A Geometric Proof of Fermat’s Little Theorem

  2018cites this paper