<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Graph edge coloring</title>
    <subTitle>Vizing's theorem and Goldberg's conjecture</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Stiebitz, Michael</namePart>
    <namePart type="date">1954-</namePart>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">nju</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Hoboken, N.J</placeTerm>
    </place>
    <publisher>Wiley</publisher>
    <dateIssued>2012</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>321 p. : ill.</extent>
  </physicalDescription>
  <abstract>"This book provides an overview of this development as well as describes how the many different results are related"--</abstract>
  <tableOfContents>HKBU library</tableOfContents>
  <note type="statement of responsibility">Michael Stiebitz ... [et al.].</note>
  <note>"Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historial context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg's conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science"-- Provided by publisher.</note>
  <note type="venue">YT2025 M10</note>
  <subject authority="lcsh">
    <topic>Graph coloring</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Graph theory</topic>
  </subject>
  <classification authority="lcc">QA166 G766 2012</classification>
  <identifier type="isbn">9781118091371</identifier>
  <identifier type="isbn">111809137X</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">SDU</recordContentSource>
    <recordCreationDate encoding="marc">111018</recordCreationDate>
  </recordInfo>
</mods>
