✦ LIBER ✦

Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs

✍ Scribed by Daneshgar, Amir

Book ID: 118199587
Publisher: Society for Industrial and Applied Mathematics
Year: 2001
Tongue: English
Weight: 179 KB
Volume: 14
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480196304994

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Addendum: Minimum Weighted Coloring of T

Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs

✍ Balas, Egon; Xue, Jue 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 88 KB

Defining sets in vertex colorings of gra

Defining sets in vertex colorings of graphs and latin rectangles

✍ E.S. Mahmoodian; Reza Naserasr; Manouchehr Zaker 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 410 KB

In a given graph G, a set of vertices S with an assignment of colors is said to be a defining set of the vertex coloring of G, if there exists a unique extension of the colors of S to a z(G)coloring of the vertices of G. The concept of a defining set has been studied, to some extent, for block desig

Defining sets and uniqueness in graph co

Defining sets and uniqueness in graph colorings: A survey

✍ E.S. Mahmoodian 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 66 KB

Structure of neighborhoods of edges in p

Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces

✍ O. V. Borodin 📂 Article 📅 1993 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 667 KB

The General Structure of Edge-Connectivi

The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case

✍ Dinitz, Yefim; Vainshtein, Alek 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 586 KB