Celina M. H. de Figueiredo

Fabiano de S. Oliveira

Discret. Comput. Geom., April, 2024

Pebbling in Kneser Graphs.

[BibT_eX]

[DOI]

Matheus Adauto

Viktoriya Bardenova

Mariana da Cruz

Glenn Hurlbert

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

MaxCut on permutation graphs is NP-complete.

[BibT_eX]

[DOI]

Fabiano de S. Oliveira

J. Graph Theory, September, 2023

On total coloring the direct product of cycles and bipartite direct product of graphs.

[BibT_eX]

[DOI]

Diane Castonguay

Discret. Math., June, 2023

On the degree of trees with game chromatic number 4.

[BibT_eX]

[DOI]

Miguel A. D. R. Palma

RAIRO Oper. Res., 2023

On the computational difficulty of the terminal connection problem.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2023

Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel.

[BibT_eX]

[DOI]

Matheus Simões

Laura Bahiense

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

On total and edge coloring some Kneser graphs.

[BibT_eX]

[DOI]

Mario Valencia-Pabon

J. Comb. Optim., 2022

Compositions, decompositions, and conformability for total coloring on power of cycle graphs.

[BibT_eX]

[DOI]

Alesom Zorzi

Leandro M. Zatesko

Discret. Appl. Math., 2022

Revising Johnson's table for the 21st century.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Computing the zig-zag number of directed graphs.

[BibT_eX]

[DOI]

Mitre Costa Dourado

Mateus de Oliveira Oliveira

Discret. Appl. Math., 2022

Total tessellation cover: Bounds, hardness, and applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage.

[BibT_eX]

[DOI]

Raul Lopes

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

A computational complexity comparative study of graph tessellation problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems.

[BibT_eX]

[DOI]

Uéverton dos Santos Souza

Networks, 2021

A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates.

[BibT_eX]

[DOI]

Edinelço Dalcumune

André da Cunha Ribeiro

Franklin de Lima Marquezino

J. Univers. Comput. Sci., 2021

Most direct product of graphs are Type 1.

[BibT_eX]

[DOI]

Diane Castonguay

CoRR, 2021

On the Terminal Connection Problem.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

On total coloring the direct product of complete graphs.

[BibT_eX]

[DOI]

Diane Castonguay

Mario Valencia-Pabon

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A multivariate analysis of the strict terminal connection problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Complexity-separating graph classes for vertex, edge and total colouring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

On the computational complexity of closest genome problems.

[BibT_eX]

[DOI]

Pedro Feijão

Discret. Appl. Math., 2020

Maximum cut on interval graphs of interval count five is NP-complete.

[BibT_eX]

[DOI]

Fabiano de S. Oliveira

CoRR, 2020

Total tessellation cover and quantum walk.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Even-power of Cycles With Many Vertices are Type 1 Total Colorable.

[BibT_eX]

[DOI]

Alesom Zorzi

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Caterpillars of Game Chromatic Number 4.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness.

[BibT_eX]

[DOI]

Priscila Petito

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers.

[BibT_eX]

[DOI]

Clément Charpentier

Discret. Math., 2019

On the embedding of cone graphs in the line with distinct distances between neighbors.

[BibT_eX]

[DOI]

Rodrigo M. Zhou

Discret. Appl. Math., 2019

Timber game as a counting problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

The Tessellation Cover Number of Good Tessellable Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Using SPQR-trees to speed up recognition algorithms based on 2-cutsets.

[BibT_eX]

[DOI]

Z. Li

Discret. Appl. Math., 2018

Sandwich and probe problems for excluding paths.

[BibT_eX]

[DOI]

Sophie Spirkl

Discret. Appl. Math., 2018

The partitioned probe problem: NP-complete versus polynomial dichotomy.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

The Sandwich Problem for Decompositions and Almost Monotone Properties.

[BibT_eX]

[DOI]

Maria Chudnovsky

Sophie Spirkl

Algorithmica, 2018

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.

[BibT_eX]

[DOI]

Tharso D. Fernandes

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

Simple Undirected Two-Commodity Integral Flow with a Unitary Demand.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

The tessellation problem of quantum walks.

[BibT_eX]

[DOI]

Tharso D. Fernandes

CoRR, 2017

Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube.

[BibT_eX]

[DOI]

R. Bruce Richter

Imrich Vrt'o

J. Graph Theory, 2016

Linear-time graph distance and diameter approximation.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2016

The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

On the total coloring of generalized Petersen graphs.

[BibT_eX]

[DOI]

Giuseppe Mazzuoccolo

Discret. Math., 2016

A note on the middle levels problem.

[BibT_eX]

[DOI]

Andréia C. S. Gusmão

Letícia Rodrigues Bueno

Discret. Appl. Math., 2016

On the equitable total chromatic number of cubic graphs.

[BibT_eX]

[DOI]

Giuseppe Mazzuoccolo

Discret. Appl. Math., 2016

The cost of perfection for matchings in graphs.

[BibT_eX]

[DOI]

Emilio Vital Brazil

Discret. Appl. Math., 2016

2015

A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*.

[BibT_eX]

[DOI]

J. Comput. Biol., 2015

A new reversible circuit synthesis algorithm based on cycle representations of permutations.

[BibT_eX]

[DOI]

A. C. Ribeiro

Electron. Notes Discret. Math., 2015

Using SPQR-trees to speed up algorithms based on 2-cutset decompositions.

[BibT_eX]

[DOI]

Raphael Carlos Santos Machado

Z. Li

Electron. Notes Discret. Math., 2015

On probe co-bipartite and probe diamond-free graphs.

[BibT_eX]

[DOI]

Flavia Bonomo

Guillermo Alfredo Durán

Luciano Norberto Grippo

Martín Darío Safe

Discret. Math. Theor. Comput. Sci., 2015

Hamiltonian cycles in unitary prefix transposition rearrangement graphs.

[BibT_eX]

[DOI]

C. S. Reis

Letícia Rodrigues Bueno

A. C. Ribeiro

Discret. Appl. Math., 2015

On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges.

[BibT_eX]

[DOI]

Raphael Carlos Santos Machado

Discret. Appl. Math., 2015

Biclique-colouring verification complexity and biclique-colouring power graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Timber Game with Caterpillars.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Sorting Separable Permutations by Restricted Multi-break Rearrangements.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Efficient sub-5 approximations for minimum dominating sets in unit disk graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Blind-friendly von Neumann's Heads or Tails.

[BibT_eX]

[DOI]

Am. Math. Mon., 2014

The hunting of a snark with total chromatic number 5.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Linear-Time Approximation Algorithms for Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013

Split clique graph complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Advancing the Transposition Distance and Diameter through Lonely Permutations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

The generalized split probe problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Edge-colouring and total-colouring chordless graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2013

The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube.

[BibT_eX]

[DOI]

R. Bruce Richter

Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On total coloring and equitable total coloring of cubic graphs with large girth.

[BibT_eX]

Giuseppe Mazzuoccolo

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Graph theory and algorithms - Fourth Latin-American Workshop on Cliques in Graphs.

[BibT_eX]

[DOI]

J. Braz. Comput. Soc., 2012

The total chromatic number of split-indifference graphs.

[BibT_eX]

[DOI]

C. N. Campos

Discret. Math., 2012

The P versus NP-complete dichotomy of some challenging problems in graph theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Cayley graphs and analysis of quantum cost for reversible circuit synthesis

[BibT_eX]

[DOI]

A. C. Ribeiro

CoRR, 2012

The Cost of Perfection for Matchings in Graphs

[BibT_eX]

[DOI]

Emilio Vital Brazil

CoRR, 2012

Transposition Diameter and Lonely Permutations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2012

Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Biclique-colouring - Powers of Paths and Powers of Cycles.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Snarks with Total Chromatic Number 5.

[BibT_eX]

Gunnar Brinkmann

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Complexity dichotomy on partial grid recognition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs.

[BibT_eX]

[DOI]

Networks, 2011

Complexity separating classes for edge-colouring and total-colouring.

[BibT_eX]

[DOI]

J. Braz. Comput. Soc., 2011

On Coloring Problems of Snark Families.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Hamiltonian Cycles in Kneser Graphs for n=2k+2.

[BibT_eX]

[DOI]

Letícia Rodrigues Bueno

Candido F. X. Mendonça

Electron. Notes Discret. Math., 2011

The external constraint 4 nonempty part sandwich problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Total chromatic number of unichord-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Transitive orientations in bull-reducible Berge graphs.

[BibT_eX]

[DOI]

Cláudia Villela Maciel

Discret. Appl. Math., 2011

On the forbidden induced subgraph sandwich problem.

[BibT_eX]

[DOI]

Murilo Vicente Gonçalves da Silva

Discret. Appl. Math., 2011

The chain graph sandwich problem.

[BibT_eX]

[DOI]

Martin Charles Golumbic

Ann. Oper. Res., 2011

Analysis and Implementation of Sorting by Transpositions Using Permutation Trees.

[BibT_eX]

[DOI]

Marcelo P. Lopes

Marília D. V. Braga

Proceedings of the Advances in Bioinformatics and Computational Biology, 2011

2010

Chromatic index of graphs with no cycle with a unique chord.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Total chromatic number of {square, unichord}-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

2K2 vertex-set partition into nonempty parts.

[BibT_eX]

[DOI]

Discret. Math., 2010

Decompositions for edge-coloring join graphs and cobipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Bounds on the Transposition Distance for Lonely Permutations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2010

Chromatic Index of Chordless Graphs.

[BibT_eX]

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Advances on the List Stubborn Problem.

[BibT_eX]

[DOI]

Loana Tito Nogueira

Fábio Protti

Proceedings of the Theory of Computing 2010, 2010

2009

The complexity of clique graph recognition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Enclosing weighted points with an almost-unit ball.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Skew partition sandwich problem is NP-complete.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Skewness, splitting number and vertex deletion of some toroidal meshes.

[BibT_eX]

Ademir Aparecido Constantino

Erico F. Xavier

Ars Comb., 2009

NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

An improved upper bound on the crossing number of the hypercube.

[BibT_eX]

[DOI]

Ondrej Sýkora

Imrich Vrto

J. Graph Theory, 2008

Helly Property, Clique Graphs, Complementary Graph Classes, and Sandwich Problems.

[BibT_eX]

[DOI]

Mitre Costa Dourado

Priscila Petito

J. Braz. Comput. Soc., 2008

The polynomial dichotomy for three nonempty part sandwich problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Sufficient conditions for a graph to be edge-colorable with maximum degree colors.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2K2 vertex-set partition into nonempty parts.

[BibT_eX]

[DOI]

Elaine M. Eschen

Electron. Notes Discret. Math., 2008

On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2008

A decomposition for total-coloring graphs of maximum degree 3.

[BibT_eX]

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.

[BibT_eX]

[DOI]

R. Sritharan

Theor. Comput. Sci., 2007

2006

Reversible Karatsuba's Algorithm.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2006

The Pair Completion algorithm for the Homogeneous Set Sandwich Problem.

[BibT_eX]

[DOI]

Claudson F. Bornstein

Inf. Process. Lett., 2006

A characterization of P4-comparability graphs.

[BibT_eX]

[DOI]

Chính T. Hoàng

Discret. Math., 2006

Extended skew partition problem.

[BibT_eX]

[DOI]

Discret. Math., 2006

The sandwich problem for cutsets: Clique cutset, k-star cutset.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

On maximum planar induced subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Algorithms for the Homogeneous Set Sandwich Problem.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Algorithmica, 2006

Clique Graph Recognition Is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005

Generating bicliques of a graph in lexicographic order.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The perfection and recognition of bull-reducible Berge graphs.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

Finding H-partitions efficiently.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

Note on the Homogeneous Set Sandwich Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Preface.

[BibT_eX]

[DOI]

Paulo Feofiloff

Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2005

Non loop graphs with induced cycles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Loop Graphs and Asteroidal Sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

The non planar vertex deletion of Cn x Cm.

[BibT_eX]

Erico F. Xavier

Ars Comb., 2005

2004

Optimizing Bull-Free Perfect Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Kinetic hanger.

[BibT_eX]

[DOI]

Paulo Cezar Pinto Carvalho

Inf. Process. Lett., 2004

The sandwich problem for cutsets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs.

[BibT_eX]

[DOI]

Candido F. X. Mendonça

Electron. Notes Discret. Math., 2004

On the generation of bicliques of a graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Tree Loop Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Stable skew partition problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

On decision and optimization (k, l)-graph sandwich problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Ton Kloks

Rolf Niedermeier

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003

Decompositions for the edge colouring of reduced indifference graphs.

[BibT_eX]

[DOI]

Carmen Ortiz

Theor. Comput. Sci., 2003

The stable marriage problem with restricted pairs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Kinetic heap-ordered trees: Tight analysis and improved algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

2002

A note on transitive orientations with maximum sets of sources and sinks.

[BibT_eX]

[DOI]

John G. Gimbel

Discret. Appl. Math., 2002

The splitting number and skewness of Cn x Cm.

[BibT_eX]

Ars Comb., 2002

On the Complexity of (k, l)-Graph Sandwich Problems.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case.

[BibT_eX]

[DOI]

Oscar Porto

Graphs Comb., 2001

On the complexity of the approximation of nonplanarity parameters for cubic graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Bull-Reducible Berge Graphs are Perfect.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Stable marriages with restricted pairs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On Tucker's proof of the strong perfect graph conjecture for (K4-e)-free graphs.

[BibT_eX]

[DOI]

Cláudia Linhares Sales

Discret. Math., 2001

Recognition of quasi-Meyniel graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

SPLITTING NUMBER is NP-complete.

[BibT_eX]

Discret. Appl. Math., 2001

2000

Finding Skew Partitions Efficiently.

[BibT_eX]

[DOI]

Yoshiharu Kohayakawa

J. Algorithms, 2000

The graph sandwich problem for 1-join composition is NP-complete.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

A class of ?-perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

Edge Colouring Reduced Indifference Graphs.

[BibT_eX]

[DOI]

Carmen Ortiz

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Linear-time Algorithms for Maximum Sets of Sources and sinks.

[BibT_eX]

[DOI]

John G. Gimbel

Electron. Notes Discret. Math., 1999

Even and Odd Pairs in Comparability and in P4-comparability Graphs.

[BibT_eX]

[DOI]

John G. Gimbel

Discret. Appl. Math., 1999

Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

The Homogeneous Set Sandwich Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

The Splitting Number of the 4-Cube.

[BibT_eX]

[DOI]

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997

On Edge-Colouring Indifference Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

On the structure of bull-free perfect graphs.

[BibT_eX]

[DOI]

Oscar Porto

Graphs Comb., 1997

Path parity and perfection.

[BibT_eX]

[DOI]

Cláudia Linhares Sales

Oscar Porto

Discret. Math., 1997

1995

A Linear-Time Algorithm for Proper Interval Graph Recognition.

[BibT_eX]

[DOI]