ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Understanding of graph theory”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DMcs.DSmath.COTheoreticalRecentJun 16, 2026

An alternative way of defining finite graphs

Maxim Nazarov

The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.

View →
cs.DScs.DMmath.COTheoreticalRecentJul 10, 2026

A Polynomial-Time Algorithm for Coloring Perfect Graphs Based on Walk Counting

Amir Ali Ahmadi, Pravesh K. Kothari, Yukai Tang

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

View →
math.COcs.DMTheoreticalRecentAug 4, 2026

A directed flat wall theorem excluding a crossrow grid

Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht

The paper presents an alternative version of the directed flat wall theorem, improving upon existing ones by excluding a different digraph as a butterfly minor.

View →
math.COcs.DMTheoreticalRecentJun 8, 2026

Biclique decompositions from Welzl orders

Jean Cardinal, Rose McCarty, Yelena Yuditsky

This paper shows that certain types of graphs can be represented compactly using biclique decompositions.

View →
math.COcs.DMTheoreticalRecentJun 28, 2026

Improved Domination--Packing Bounds in Claw-Free Cubic Graphs and Unit Disk Graphs

Juan Gutiérrez, Kaustav Paul

This paper improves the known bounds on the ratio between domination number and packing number in unit disk graphs and bridgeless claw-free cubic graphs.

View →
cs.NIEmpiricalRecentJul 27, 2026

Methods for Path Set Attribute Calculation in Network Systems

Giovanni Fiaschi, Carlo Vitucci, Thomas Westerbäck, Daniel Sundmark +1 more

This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

View →
cs.DMmath.COTheoreticalRecentJul 18, 2026

Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth

Gaétan Berthe, Florent Foucaud, Tuomo Lehtilä, Aline Parreau

This paper provides bounds on the neighborhood complexity of graphs with bounded treewidth and pathwidth, and constructs reaching these bounds.

View →
cs.DMmath.COTheoreticalRecentJul 26, 2026

Set-defined graph classes: $χ$-boundedness meets tropical algebra

Sarosh Adenwalla, Samuel Braunfeld, Tomáš Hons, John Sylvester +1 more

This paper studies set-defined graph classes and proves that bounded unions of shift-colorable graphs form the fundamental obstruction to chromatic number boundness in these classes.

View →
cs.DMmath.COTheoreticalRecentJul 3, 2026

The disjoint separators problem in graphs

Thomas Delépine, Florian Galliot, Yannick Mogge, Leandro Montero +1 more

This paper studies the NP-completeness and provides a polynomial-time algorithm for the disjoint separators problem in planar graphs when all sizes are equal to one.

View →
cs.CGcs.DMmath.COTheoreticalRecentJun 25, 2026

Unbent collections of non-planar $s$-grid-drawing

Therese Biedl

The paper shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.

View →
cs.DMmath.COTheoreticalRecentAug 11, 2026

How Difficult Is It to Recognize CIS Graphs?

Rongchuan Tao, Mengxi Yang, Wenan Zang

This paper shows that recognizing CIS graphs is coNP-complete.

View →
math.COcs.CCTheoreticalRecentJul 10, 2026

Cut-homotopies and the complexity of edge-coloring problems

Alexey Barsukov, Roman Feller, Maximilian Hadek, Davide Perinti

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

View →
math.COcs.DMTheoreticalRecentJul 19, 2026

Strong edge-colouring via local flag algebras

Eoin Davey, Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang +1 more

This paper uses local flag algebra to prove bounds on the strong chromatic index of graphs, making progress towards established conjectures for general, bipartite, and asymmetric bipartite graphs.

View →